ppxscal/embedding_network huggingface dataset:
Predicting user behavior&mdash;the creation of the immersion installation
Authors: Andrew Buchanan
Venue: Computers in Entertainment (CIE) (2008)

This article is a retrospective case study of the creation of an interactive projection installation titled Immersion, produced in 2007 and commissioned for the Experimenta Biennale Media Arts exhibition&mdash;Experimenta Playground. The article explains the project conceptually and technically, and outlines the processes of the artists with regards to their attempts to predict the responses and reactions of the pubic to the finished work. Reference is made to some established methodologies for the prediction of user behavior and explains findings from user-testing phases and the influence of these findings on artistic direction for the project. The article also identifies the potential for passive audiences in interactive works and describes some of these in response to the finished installation.
Infinite paths in planar graphs III, 1-way infinite paths
Authors: Xingxing Yu
Venue: Journal of Graph Theory (2006)

An infinite graph is 2-indivisible if the deletion of any finite set of vertices from the graph results in exactly one infinite component. Let G be a 4-connected, 2-indivisible, infinite, plane graph. It is known that G contains a spanning 1-way infinite path. In this paper, we prove a stronger result by showing that, for any vertex x and any edge e on a facial cycle of G, there is a spanning 1-way infinite path in G from x and through e. Results will be used in two forthcoming papers to establish a conjecture of Nash-Williams. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Introduction of TTCN-3 into the product development process: considerations from an electronic devices developer point of view
Authors: Martin Botteck, Thomas Dei&#x00df;
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

Following the successful standardisation of TTCN-3, several attempts were made to introduce the language into the product development process to improve the related testing activities. For several years appreciation was moderate. Reasons are to be found in the structure of existing testing procedures and problems of interoperability in early TTCN-3 products. Testing and development environments typical for electronic devices manufacturing are outlined and it is shown where in the process future benefits through further formalisation of test definition and implementations may be found.
Impact of JVM superoperators on energy consumption in resource-constrained embedded systems
Authors: Carmen Badea, Alexandru Nicolau, Alexander V. Veidenbaum
Venue: ACM SIGPLAN Notices (2008)

Energy consumption is one of the most important issues in resource-constrained embedded systems. Many such systems run Java-based applications due to Java's architecture-independent format (bytecode). Standard techniques for executing bytecode programs, e.g. interpretation or just-in-time compilation, have performance or memory issues that make them unsuitable for resource-constrained embedded systems. A superoperator-extended, lightweight Java Virtual Machine (JVM) can be used in resource-constrained embedded systems to improve performance and reduce memory consumption. This paper shows that such a JVM also significantly reduces energy consumption. This is due primarily to a considerable reduction in the number of memory accesses and thus in energy consumption in the instruction and data TLBs and caches and, in most cases, in DRAM energy consumption. Since the fraction of processor energy dissipated in these units is approximately 60%, the energy savings achieved are significant. The paper evaluates the number of load, store, and computational instructions eliminated by the use of proposed superoperators as compared to a simple interpreter on a set of embedded benchmarks. Using cache and DRAM per access energy we estimate the total processor/DRAM energy saved by using our JVM. Our results show that with 32KB caches the reduction in energy consumption ranges from 40% to 60% of the overall processor, plus DRAM energy. Even higher savings may be achieved with smaller caches and increased access to DRAM as DRAM access energy is fairly high.
Applications of the gröbner fan to gene network reconstruction (abstract only)
Authors: Elena S. Dimitrova, Brandilyn Stigler, Abdul Salam Jarrah, Reinhard Laubenbacher
Venue: ACM Communications in Computer Algebra (2008)

Gröbner fans have gained popularity in computational commutative algebra and algebraic geometry with applications ranging from Gröbner basis conversion to the emerging field of tropical mathematics. Recently Gröbner fans have been employed for the selection of minimal models that fit measurement data from gene regulatory networks. The model space is described as the sum of an interpolating polynomial function f and the set of all polynomials that vanish on the data, that is, the ideal of data points. A minimal model can be chosen by computing the reduction of f with respect to a fixed Gröbner basis, which is dependent on the choice of term order. As Gröbner fans partition the set of Gröbner bases into equivalence classes, they can be thought of as parametrizations of the model space. This characterization permits exploration of the model space and discovery of "most likely" models. In this poster we show how Gröbner fans are used to two reconstruct gene regulatory networks: lactose metabolism in the bacterium E. coli and tissue development in the roundworm C. elegans.
Algebraic methods for interactive proof systems
Authors: C. Lund, L. Fortnow, H. Karloff
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. For the proof, a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications for program checking, verification, and self-correction.
EigenRank: a ranking-oriented approach to collaborative filtering
Authors: Nathan N. Liu, Qiang Yang
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a database of users' past ratings on a set of items, traditional collaborative filtering algorithms are based on predicting the potential ratings that a user would assign to the unrated items so that they can be ranked by the predicted ratings to produce a list of recommended items. In this paper, we propose a collaborative filtering approach that addresses the item ranking problem directly by modeling user preferences derived from the ratings. We measure the similarity between users based on the correlation between their rankings of the items rather than the rating values and propose new collaborative filtering algorithms for ranking items based on the preferences of similar users. Experimental results on real world movie rating data sets show that the proposed approach outperforms traditional collaborative filtering algorithms significantly on the NDCG measure for evaluating ranked results.
Differentially fed neural networks as ideal estimators in Bayesian space
Authors: R. Manjunath, K. S. Gurumurthy
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

The interactions among a family of probability distributions can be studied under Information Geometry. With Bayesian decision theory, these interactions lead to the concept of "ideal estimates". In this paper the concept of differential feedback is added to Information geometry. Here the probability distribution is mapped on to the hyperplanes with ideal estimates on the Eigenplane.
Analysing formal models of genetic regulatory networks with delays
Authors: Jamil Ahmad, Olivier Roux, Gilles Bernot, Jean-Paul Comet, Adrien Richard
Venue: International Journal of Bioinformatics Research and Applications (2008)

In this paper, we propose a refinement of the modelling of biological regulatory networks based on the discrete approach of Rene Thomas. We refine and automatise the use of delays of activation/inhibition in order to specify which variable is more quickly affected by a change of its regulators. The formalism of linear hybrid automata is well suited to allow such refinement. We then use HyTech for two purposes: to find automatically all paths from a specified initial state to another one; to synthesise constraints on the delay parameters in order to follow any specific path.
Towards an Architecture for Balancing Privacy and Traceability in Ubiquitous Computing Environments
Authors: Stefan G. Weber, Andreas Heinemann, Max Mühlhäuser
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Privacy Preservation has been identified as an important factor to the success and acceptance of Ubiquitous Compu-ting systems. Traceability, i.e.~attributing events and actions to those who caused them, seems to be a directly contradicting goal. However, harnessing sensitive data collected by Ubiquitous Computing infrastructures for traceability applications in a privacy-respecting manner may clearly bring further benefits, for different concerned parties. Automated working hours recording and personalized insurances are first examples of such applications.To contribute to this matter, this paper presents an architecture that allows for balancing between privacy and traceability in Ubiquitous Computing environments. We describe its foundations and components and illustrate its benefits. Moreover, we discuss important existing research approaches on privacy protection and traceability applications in Ubiquitous Computing settings.
Sharp Jackson inequalities
Authors: F. Dai, Z. Ditzian, S. Tikhonov
Venue: Journal of Approximation Theory (2008)

For trigonometric polynomials on [-@p,@p]=T, the classical Jackson inequality E"n(f)"p=
The Fmics View On The Verified Software Repository
Authors: Alvaro E. Arenas, Juan C. Bicarregui, Tiziana Margaria
Venue: Journal of Integrated Design Process Science (2006)

An important step in meeting the Verifying Compiler Grand Challenge is the Verified Software Repository. In the FMICS view, the repository should include proven correct software and tools to help establishing the correctness of the software in question. We propose to set up a collaborative demonstrator, based on the jETI technology, to provide tools to the repository and to orchestrate different tools.
Combining building blocks for parallel multi-level matrix multiplication
Authors: S. Hunold, T. Rauber, G. Rünger
Venue: Parallel Computing (2008)

This paper presents parallel algorithms for matrix-matrix multiplication which are built up from several algorithms in a multi-level structure. The upper level consists of Strassen's algorithm which is performed for a predefined number of recursions. The number of recursions can be adapted to the specific execution platform. The intermediate level is performed by a parallel non-hierarchical algorithm and the lower level uses efficient one-processor implementations of matrix-matrix multiplication like BLAS or ATLAS. Both the number of recursions of Strassen's algorithm and the specific algorithms of the intermediate and lower level can be chosen so that a variety of different multi-level algorithms results. Each level of the multi-level algorithms is associated with a hierarchical partition of the set of available processors into disjoint subsets so that deeper levels of the algorithm employ smaller groups of processors in parallel. The algorithms are expressed in the multiprocessor task programming model and are coded with the runtime library Tlib. Performance experiments on several parallel platforms show that the multi-level algorithms can lead to significant performance gains.
The parallel complexity of the subgraph connectivity problem
Authors: L. Kirousis
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

It is shown that the problem of testing whether a graph G contains a vertex- (edge-) connected induced subgraph of cardinality k is P-complete for any fixed k>or=3. Moreover, it is shown that approximating within a factor c>1/2 the maximum d for which there is a d-vertex-(d-edge-) connected induced subgraph of G is not in NC, unless P=NC. In contrast, it is known that the problem of finding the Tutte (triconnected) components of G is in NC. On the positive side, it is shown by proving extremal-graph results, that the maximum d for which there is a d-edge-connected induced subgraph of G can be approximated in NC within any factor c
A geographic routing protocol utilizing link lifetime and power control for mobile ad hoc networks
Authors: Sangsu Jung, Dujeong Lee, Sangyoon Yoon, Jaehwi Shin, Youngwoo Lee, Jeonghoon Mo
Venue: Proceeding of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (2008)

It is known that existing geographic routing cannot maintain its capability in sparse networks compared to that in dense networks. Furthermore, mobile environments worsen the performance of greedy forwarding based routing. To become a practical protocol candidate, it is necessary to sustain stable performance irrespective of a network topology and mobility. For this purpose, we propose a novel geographic routing protocol, Power Boosting Geographic Routing with link lifetime estimation (PBGR), which utilizes link lifetime estimation and power control on the top of geographic routing. Specifically, the link life time estimation can upgrade the performance of greedy forwarding under mobile scenarios and the power boosting enables greedy forwarding to maintain its strength in sparse networks. Simulation results exhibit superior performance of our protocol.
Decision versus search problems in super-polynomial time
Authors: R. Impagliazzo
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The following propositions are considered: (1) E=NE (i.e. it is decidable in exponential time whether there is a solution for an exponential-type search problem). (2) Every exponential-type search problem is solvable in exponential time. (3) The first solution to every exponential-type search problem can be found in exponential time. (4) E=E/sup NP/. It is easy to see that (4) implies (3) implies (2) implies (1). It has been conjectured that the first and last of these assumptions are equivalent in every relativized world. It is proved here that there exist relativized words in which the last two implications are not reversible. This is evidence that the search problem is not reducible to decision problems in exponential time. It is also proved that the third and fourth assumptions are equivalent. The combinatorial core of the separation results is a lower bound on the parallel complexity of a generalized version of the X-search problem.
A MATLAB program for estimation of unsaturated hydraulic soil parameters using an infiltrometer technique
Authors: Mikkel Mollerup, Søren Hansen, Carsten Petersen, Jeppe H. Kjaersgaard
Venue: Computers Geosciences (2008)

We combined an inverse routine for assessing the hydraulic soil parameters of the Campbell/Mualem model with the power series solution developed by Philip for describing one-dimensional vertical infiltration into a homogenous soil. We based the estimation routine on a proposed measurement procedure especially suitable for early-time infiltrometer experiments where the flow can be considered as one-dimensional. The routine requires input of the initial soil water content and cumulative infiltration in two experiments with different pressures at the upper boundary and/or initial conditions. An independent measurement of the soil water content at saturation may reduce the uncertainty of estimated parameters. Response surfaces of the objective function were analysed. Scenarios for various soils and conditions, using numerically generated synthetic cumulative infiltration data with normally distributed errors, show promising results for finding the true values of the optimized parameters. We also investigated the effects of measurement frequency for the cumulative infiltration and errors in water content determinations.
Buffer overflow asymptotics for multiplexed regulated traffic
Authors: Y. Ying, F. Guillemin, R. Mazumdar, C. Rosenberg
Venue: Performance Evaluation (2008)

By characterizing the worst-case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upper bound in the many-sources regime for the tail distribution of the workload generated by these flows in a FIFO queue with constant service rate. Furthermore, we compare this workload distribution with an M/G/1 queue and get insights on the better-than-Poisson property of regulated flows. We conclude that the superposition of independent regulated flows generates an asymptotically smaller workload than a marked Poisson process whose service times and intensity depend on the parameters of regulated sources.
INTEGRATING LIBRARY SERVICES AND RESOURCES AT THE OPEN UNIVERSITY
Authors: Susan Eales, Non Scantlebury
Venue: The New Review of Information Networking (2007)

This paper was presented at the cpd25 Conference, London, on 23 April 2007. It gives an overview of the development of the Open University virtual learning environment (OU VLE), using the Moodle open source solution. In particular, this paper provides information and illustration of the Moodle enhancement projects that are being led by the Library, and the new e-portfolio system-MyStuff-into which the Library is having significant input. The paper concludes by indicating how involvement in the development of the new Library website, called Open Library 2.0, and in the OU VLE, has benefited this work and the overall reputation of the Library.
Choosing knowledge management strategies by using a combined ANP and DEMATEL approach
Authors: Wei-Wen Wu
Venue: Expert Systems with Applications: An International Journal (2008)

Numerous companies are expecting their knowledge management (KM) to be performed effectively in order to leverage and transform the knowledge into competitive advantages. However, here raises a critical issue of how companies can better evaluate and select a favorable KM strategy prior to a successful KM implementation. The KM strategy selection is a kind of multiple criteria decision-making (MCDM) problem, which requires considering a large number of complex factors as multiple evaluation criteria. A robust MCDM method should consider the interactions among criteria. The analytic network process (ANP) is a relatively new MCDM method which can deal with all kinds of interactions systematically. Moreover, the Decision Making Trial and Evaluation Laboratory (DEMATEL) not only can convert the relations between cause and effect of criteria into a visual structural model, but also can be used as a way to handle the inner dependences within a set of criteria. Hence, this paper proposes an effective solution based on a combined ANP and DEMATEL approach to help companies that need to evaluate and select KM strategies. Additionally, an empirical study is presented to illustrate the application of the proposed method.
What can we sort in o(nlog n) time?
Authors: A. M. Ben-Amram, Z. Galil
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We define two conditions on a random access machine (RAM) with arithmetic and Boolean instructions and possible bounds on word and memory sizes. One condition asserts that we either restrict attention to short words or allow non-uniform programs. The second asserts that we either allow a large memory or a double-precision multiplication. Our main theorem shows that the RAM can sort in o(nlog n) time if and only if both of these conditions hold. This theorem breaks down into four upper bounds only one of which has been known before, and two lower bounds neither of which has been known.
A generic grid interface for parallel and adaptive scientific computing. Part I: abstract framework
Authors: P. Bastian, M. Blatt, A. Dedner, C. Engwer, R. Kl&#x00f6;fkorn, M. Ohlberger, O. Sander
Venue: Computing (2008)

We give a mathematically rigorous definition of a grid for algorithms solving partial differential equations. Unlike previous approaches (Benger 2005, PhD thesis; Berti 2000, PhD thesis), our grids have a hierarchical structure. This makes them suitable for geometric multigrid algorithms and hierarchical local grid refinement. The description is also general enough to include geometrically non-conforming grids. The definitions in this article serve as the basis for an implementation of an abstract grid interface as C++ classes in the framework (Bastian et al. 2008, this issue).
The fun of using TCP for an MMORPG
Authors: Carsten Griwodz, Pål Halvorsen
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Massive multi-player online games have become a popular, fast growing, multi-million industry with a very high user mass supporting hundreds or thousands of concurrent players. In many cases, these games are centralized and every player communicates with the central server through a time-critical unicast event stream. Funcom's Anarchy Online is one of these; it is based on TCP. We find that its kind of traffic has some interesting properties that inspire changes to protocol or architecture. In these game streams, TCP does not back off, using TCP does not have to be slower than using UDP, and almost only repeated timeouts ruin the game experience. Improving the latter in the sender implementation does not impose any remarkable penalty on the network. Alternatively, a proxy architecture for multiplexing could save about 40% resources at the server, allow congestion control to work and also reduce the lag of the game.
Multimodality Medical Image Registration Using Hybrid Optimization Algorithm
Authors: Hanling Zhang, Fan Yang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Optimization of a similarity metric is a essential component in multimodality medical image registration. In this paper, a hybrid optimization algorithm is proposed. When dealing with multimodality medical images, the authors search the best matching parameters by applying mutual information as similarity measure and hybrid optimization algorithm as search strategy. The registration results prove that the subvoxel accuracy can be achieved and this method is an efficient registration one which can avoid getting into the local optimum.