ppxscal/embedding_network huggingface dataset:
On Some SAT-Variants over Linear Formulas
Authors: Stefan Porschen, Tatjana Schmidt
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We investigate the computational complexity of some prominent variants of the propositional satisfiability problem (SAT), namely not-all-equal SAT (NAE-SAT) and exact SAT (XSAT) restricted to the class of linear conjunctive normal form (CNF) formulas. Clauses of a linear formula pairwise have at most one variable in common. We prove that NAE-SAT and XSAT both remain NP-complete when restricted to linear formulas. Since the corresponding reduction is not valid when input formulas are not allowed to have 2-clauses, we also prove that NAE-SAT and XSAT still behave NP-complete on formulas only containing clauses of length at least k, for each fixed integer k&thinsp;&ge;&thinsp;3. Moreover, NP-completeness proofs for NAE-SAT and XSAT restricted to monotone linear formulas are presented. We also discuss the length restricted monotone linear formula classes regarding NP-completeness where a difficulty arises for NAE-SAT, when all clauses are k-uniform, for k&thinsp;&ge;&thinsp;4. Finally, we show that NAE-SAT is polynomial-time decidable on exact linear formulas, where each pair of distinct clauses has exactly one variable in common. And, we give some hints regarding the complexity of XSAT on the exact linear class.
Stochastic Subset Optimization for reliability optimization and sensitivity analysis in system design
Authors: Alexandros A. Taflanidis, James L. Beck
Venue: Computers and Structures (2009)

Design problems that involve the system reliability as the objective function are discussed. In order to appropriately address the challenges of such applications when complex system models are involved, stochastic simulation is selected to evaluate the probability of failure. An innovative algorithm, called Stochastic Subset Optimization (SSO), is discussed for performing the reliability optimization as well as an efficient sensitivity analysis. The basic principle in SSO is the formulation of an augmented problem where the design variables are artificially considered as uncertain. Stochastic simulation techniques are implemented in order to simulate samples of these variables that lead to system failure. The information that these samples provide is then exploited in an iterative approach in SSO to identify a smaller subset of the design space that consists of near-optimal design variables and also that has high plausibility of containing the optimal design. At the same time, a sensitivity analysis for the influence of both the design variables and the uncertain model parameters is established.
Marketplace-Oriented Behavior in Semantic Multi-Criteria Decision Making Autonomous Systems
Authors: Ghadi Mahmoudi, Christian Müller-Schloer, Jörg Hähner
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

Autonomy in Organic Computing systems is supposed to ensure well-functioning engineering systems. Our approach called Semantic Multi-Criteria Decision Making (SeMCDM) brings the decision making process of autonomous units close to the intention of human designers. This paper studies the integration of marketplace-oriented behavior into SeMCDM. It defines distributed and centralized market scenarios, suggests evaluation metrics with consideration of resource-restricted applications, extracts related characteristics of the application environment and presents simulation results. The paper concludes with recommendations about the adequate market scenario in relation to the application environment.
Letter to the Editor: A collocated finite volume scheme to solve free convection for general non-conforming grids
Authors: Eric Chénier, Robert Eymard, Raphaèle Herbin
Venue: Journal of Computational Physics (2009)

We present a new collocated numerical scheme for the approximation of the Navier-Stokes and energy equations under the Boussinesq assumption for general grids, using the velocity-pressure unknowns. This scheme is based on a recent scheme for the diffusion terms. Stability properties are drawn from particular choices for the pressure gradient and the non-linear terms. Convergence of the approximate solutions may be proven mathematically. Numerical results show the accuracy of the scheme on irregular grids.
A scalable framework for parallel discrete event simulations on desktop grids
Authors: Alfred Park, Richard Fujimoto
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Utilizing desktop grid infrastructures is challenging for parallel discrete event simulation (PDES) codes due to characteristics such as inter-process messaging, restricted execution, and overall lower concurrency than typical volunteer computing projects. The Aurora2 system uses an approach that simultaneously provides both replicated execution support and scalable performance of PDES applications through public resource computing. This is accomplished through a multi-threaded distributed back-end system, low overhead communications middleware, and an efficient client implementation. This paper describes the Aurora2 architecture and issues pertinent to PDES executions in a desktop grid environment that must be addressed when distributing back-end services across multiple machines. We quantify improvement over the first generation Aurora system through a comparative performance study detailing PDES programs with various scalability characteristics for execution over desktop grids.
Real-Time Nonlinear Facial Feature Extraction Using Cholesky Decomposition and QR Decomposition for Face Recognition
Authors: Yunhui He
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, we propose an efficient and effective method for extracting nonlinear discriminative facial features for real-time face recognition tasks. The optimal nonlinear discriminative features of face images are obtained by performing Cholesky decomposition and QR Decomposition only once respectively, which could be implemented using the existing fast algorithms. Since the proposed method does not solve the generalized eigenequation, the high numerical stability is achieved. Moreover, because there is no need to compute the mean of classes and the mean of total samples in the proposed method, the computational complexity is reduced greatly. Thus, the real-time performance for face recognition is guaranteed. The experiments on two standard face databases show that the proposed method can achieve better performance compared with linear facial features extraction method.
Au-del&agrave; de l'utilisabilit&eacute;: l'autot&eacute;lie
Authors: Annemarie Lesage, Tomás Dorta
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

This theoretical proposition is set in the context of user experience as a new paradigm in HCI. Staying away from the work-leisure dichotomy, usability can be understood as supporting extrinsically motivated experiences, therefore identifying its complementary as a principle supporting intrinsically motivated experiences: the autotelic principle (autotelic: that which is its own goal). This principle helps us look at human experience through goals, needs and motivation.
Using code instrumentation to enhance testing on J2ME: a lesson learned with JInjector
Authors: Michele Sama, Julian Harty
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

A wide range of J2ME applications are GUI-driven with significant code dedicated to handle the graphical user interface (GUI). To maximize the chances of detecting bugs, effective testing of such applications require end-to-end testing on devices; as some bugs are related to specific devices. Unfortunately there are few software tools, such as code coverage and GUI testing tools, suitable for testing J2ME applications. A tool which we implemented, JInjector, instruments the system under test (SUT) in order to run automated tests in emulators and on the actual devices we need to support. In this paper we discuss the theory behind two features of JInjector: code coverage, and end-to-end testing, and the results from testing a fully-featured commercial application.
Original paper: Modelling airflow within model plant canopies using an integrated approach
Authors: A. Melese Endalew, M. Hertog, M. Gebreslasie Gebrehiwot, M. Baelmans, H. Ramon, B. M. Nicolaï, P. Verboven
Venue: Computers and Electronics in Agriculture (2009)

A direct 3D CFD modelling of airflow within model plant canopies was performed with separate models for the leaves and the branches of the canopy. The effect of the branches on airflow was modelled by introducing the 3D architecture of the canopies into the model and that of the leaves was modelled by adding drag force terms in the momentum and turbulent energy equations in porous sub-domains created around the branches. Wind tunnel experiments were used to validate the model. The experiments were carried out for inlet velocities of 10ms-1 and 15ms-1 with two artificial 1:10 scaled model trees, fully leafed, half leafed and leafless. Simulations were made with a full closure model (FCM) and with the presented integrated model (IM). FCM and IM gave a maximum percent error of 34 and 30, respectively for average air velocity, U. On horizontal average basis both methods gave fairly comparable accuracies with maximum errors of 16.6% for FCM and 13.7% for IM but on local basis both horizontally and vertically within the tree height the present approach gave a better accuracy. The present model also gave qualitatively good results for turbulent kinetic energy.
A modeling method for service management of e-Learning
Authors: Jyhjong Lin
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

For the rapid advances of Internet technologies and Web applications in recent years, providing opportunities to learn outside of the traditional classroom-based education has gained many attentions as a new theme for prospect learners to acquire knowledge in a more convenient way. In this new paradigm of the so called electronic learning (e-Learning), many efforts have been made to build Web based learning systems that manage desired e-Learning processes. From the managerial perspective on education, this means that each desired e-Learning process is monitored and controlled for fulfilling an expected learning objective. In this paper, we propose an object-oriented modeling method that addresses this issue by dividing required mechanisms into three layers: learning objective, learning service agent, and learning service composition ones. With this architecture, e-Learning processes are managed via the recognition of a learning objective, the employment of a learning service agent that arranges a process of demanded learning services for achieving the objective, and the confirmation of interactions/coordination among these services in achieving the objective. For specification, an object-oriented model is presented for each layer that describes the working detail of that layer. To illustrate, these models are applied in the fulfillment of an e-Learning plan for learning about Software Engineering that involves a set of learning objectives to be achieved by various processes of learning services.
Dagstuhl perspectives workshop on end-to-end protocols for the future internet
Authors: Jari Arkko, Bob Briscoe, Lars Eggert, Anja Feldmann, Mark Handley
Venue: ACM SIGCOMM Computer Communication Review (2009)

This article summarises the presentations and discussions during a workshop on end-to-end protocols for the future Internet in June 2008. The aim of the workshop was to establish a dialogue at the interface between two otherwise fairly distinct communities working on future Internet protocols: those developing internetworking functions and those developing end-to-end transport protocols. The discussion established near-consensus on some of the open issues, such as the preferred placement of traffic engineering functionality, whereas other questions remained controversial. New research agenda items were also identified.
Bayesian estimation of quantile distributions
Authors: D. Allingham, R. A. King, K. L. Mengersen
Venue: Statistics and Computing (2009)

Use of Bayesian modelling and analysis has become commonplace in many disciplines (finance, genetics and image analysis, for example). Many complex data sets are collected which do not readily admit standard distributions, and often comprise skew and kurtotic data. Such data is well-modelled by the very flexibly-shaped distributions of the quantile distribution family, whose members are defined by the inverse of their cumulative distribution functions and rarely have analytical likelihood functions defined. Without explicit likelihood functions, Bayesian methodologies such as Gibbs sampling cannot be applied to parameter estimation for this valuable class of distributions without resorting to numerical inversion. Approximate Bayesian computation provides an alternative approach requiring only a sampling scheme for the distribution of interest, enabling easier use of quantile distributions under the Bayesian framework. Parameter estimates for simulated and experimental data are presented.
An Analytic Logic of Aggregation
Authors: Patrick Girard, Jeremy Seligman
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

We present a modular approach to the logic of aggregated group preferences based on hybrid modal logic. The modularity of the system is twofold: 1) lifting preference relations between states to complex relations between propositions and 2) lifting individual preferences to group preferences. The preferences may be doxastic or proairetic, generating a logic of aggregated belief or aggregated desire, respectively, using a specific aggregation policy known as `lexicographic re-ordering'. Each agent and each group of agents has an associated modal operator representing their preferences between states. The addition of the existential modality and nominals allows us to produce, first, a Hilbert-style axiomatization of the logic and then a more thorough analysis of inference using a Gentzen-style sequent calculus, in which the role of each operator is revealed.
PEAKS - A system for the automatic evaluation of voice and speech disorders
Authors: A. Maier, T. Haderlein, U. Eysholdt, F. Rosanowski, A. Batliner, M. Schuster, E. Nöth
Venue: Speech Communication (2009)

We present a novel system for the automatic evaluation of speech and voice disorders. The system can be accessed via the internet platform-independently. The patient reads a text or names pictures. His or her speech is then analyzed by automatic speech recognition and prosodic analysis. For patients who had their larynx removed due to cancer and for children with cleft lip and palate we show that we can achieve significant correlations between the automatic analysis and the judgment of human experts in a leave-one-out experiment (p
Grooming of traffic using improved evolutionary algorithm in universal optical network
Authors: Yishi Han, Zhanbin Ao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, the traffic grooming based on Adaptive Immune Evolutionary Algorithm (AIEA) was proposed. The problem of traffic grooming was formulated in optical networks, including main constrain, upper limit and optimized objectives. The process of AIEA was also given by flowchart. Computer simulations were performed with arbitrary traffic pattern and universal optical network topologies, such as ring networks and mesh networks. Comparison with other heuristic algorithms, the results show AIEA has better resource utilization, good convergence rate and global optimization features in optical network, especial in complex mesh optical network.
Partitioning parallel discrete event simulation
Authors: Hristo Valchanov, Nadezhda Ruskova, Dimitar Genov, Nedjalko Nikolov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Parallel Discrete Event Simulation (PDES) allows to speed up the execution of a simulation by distributing the simulation's workload between multiple processors. The mapping of the simulation entities over the processors is very important with regard to the efficiency of the overall process of simulation. This paper presents an approach for automation of the process of mapping over distributed environment (network of workstations) for optimistic simulation based on the synchronization protocol Time Warp.
A Control-oriented Macroscopic Traffic Flow Model for Urban Diverse Intersections
Authors: Kaige Wen, Shiru Qu, Yumei Zhang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Traffic flow on roads is a non-linear, stochastic phenomenon, with complex interactions between vehicles. This paper discussed the dynamic nature of urban intersections, and presents a novel traffic flow evolution model at a time scale and of a level of detail suitable for on-line estimation, simulation and control. The intersection is considered as interconnected components of urban road network. The macroscopic model proposed here extends the platoon-dispersion model by redefining inflow and outflow vectors, and by also specifying the control vector. Two variables were added to the model, i.e. the turning proportion and the lane assignment scheme. The turning proportion is an obvious variant, and yet the lane assignment is time-varying in some especial condition. Simple stochastic matrix equations described the macroscopic traffic behavior of each movement. This will allow the simulation of quite large road networks by composing many intersection models. The model is validated over real traffic data with abrupt changes in the demand of flow.
An Indian logic-based knowledge-sharing architecture for virtual knowledge communities
Authors: G. S. Mahalakshmi, M. Karpagaraj, T. V. Geetha
Venue: International Journal of Networking and Virtual Organisations (2009)

This paper discusses autonomous Knowledge Sharing (KS) among a collection of KS volunteers, called the virtual knowledge community. The KS protocol determines the inclusion/exclusion of knowledge volunteers and regulates the discussion within the community. The entire autonomous discussion takes place with the initial predicates of world knowledge ontology represented in Indianised Logics. During discussion, the proponent refers to the invariable concomitance relation between the relating concepts to explain the inference to other opponents. The knowledge volunteers are grouped according to a degree of trust, based on which the proposed knowledge is either accepted or rejected. Therefore, by rationally exchanging questions and answers in a debate fashion, knowledge is explored and a definite conclusion is reached at the end of the discussion, irrespective of the winning/losing of the individual arguments. In this fashion, autonomous knowledge volunteers gain new and valid knowledge, using which they arrive at new conclusions in the future.
The implementation and comparison of non-overlapped and half-overlapped filtered multitone modulation
Authors: Ondrej Krajsa, Pavel Silhavy
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

In this article an analysis of MultiCarrier Modulation (MCM) is realized, concretely analysis of Discrete MultiTone modulation (DMT), alternative modulation based on filter bank - Filtered MultiTone (FMT) and its half-overlapped version. Implementation of these modulations is described in the last part of this paper.
Four Graph Partitioning Algorithms
Authors: Fan Chung Graham
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We will discuss four partitioning algorithms using eigenvectors, random walks, PageRank and their variations. In particular, we will examine local partitioning algorithms, which find a cut near a specified starting vertex, with a running time that depends on the size of the small side of the cut, rather than on the size of the input graph (which can be prohibitively large). Three of the four partitioning algorithms are local algorithms and are particularly appropriate for applications arising in connection with Webgraphs and Internet economics.
On the 3-restricted edge connectivity of permutation graphs
Authors: C. Balbuena, D. González-Moreno, X. Marcote
Venue: Discrete Applied Mathematics (2009)

An edge cut W of a connected graph G is a k-restricted edge cut if G-W is disconnected, and every component of G-W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge connectivity of a permutation graph is upper bounded by the so-called minimum k-edge degree. In this paper some sufficient conditions guaranteeing optimal k-restricted edge connectivity and super k-restricted edge connectivity for permutation graphs are presented for k=2,3.
Graphical models for interactive POMDPs: representations and solutions
Authors: Prashant Doshi, Yifeng Zeng, Qiongyu Chen
Venue: Autonomous Agents and Multi-Agent Systems (2009)

We develop new graphical representations for the problem of sequential decision making in partially observable multiagent environments, as formalized by interactive partially observable Markov decision processes (I-POMDPs). The graphical models called interactive influence diagrams (I-IDs) and their dynamic counterparts, interactive dynamic influence diagrams (I-DIDs), seek to explicitly model the structure that is often present in real-world problems by decomposing the situation into chance and decision variables, and the dependencies between the variables. I-DIDs generalize DIDs, which may be viewed as graphical representations of POMDPs, to multiagent settings in the same way that I-POMDPs generalize POMDPs. I-DIDs may be used to compute the policy of an agent given its belief as the agent acts and observes in a setting that is populated by other interacting agents. Using several examples, we show how I-IDs and I-DIDs may be applied and demonstrate their usefulness. We also show how the models may be solved using the standard algorithms that are applicable to DIDs. Solving I-DIDs exactly involves knowing the solutions of possible models of the other agents. The space of models grows exponentially with the number of time steps. We present a method of solving I-DIDs approximately by limiting the number of other agents' candidate models at each time step to a constant. We do this by clustering models that are likely to be behaviorally equivalent and selecting a representative set from the clusters. We discuss the error bound of the approximation technique and demonstrate its empirical performance.