ppxscal/embedding_network huggingface dataset:
Reversal-bounded multi-pushdown machines
Authors: Brenda S. Baker, Ronald V. Book
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

This paper presents several representations of the recursively enumerable (r.e.) sets. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. Another states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown stores such that in every computation, each pushdown store can make at most one reversal (that is, one change from "pushing" to "popping"). It is shown that this automatatheoretic representation cannot be strengthened by restricting the acceptors to be either deterministic multitape, nondeterministic one-tape, or nondeterministic multicounter acceptors. An investigation of the properties of reversal-bounded computations suggests that reversal bounds are not a "natural" measure of computational complexity for multitape Turing acceptors. The above results are used to obtain an independence theorem for full semi-AFLs and an undecidability result for effective families of languages.
Visualization of Uncertainty and Reasoning
Authors: Torre Zuk, Sheelagh Carpendale
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

This article gathers and consolidates the issues involved in uncertainty relating to reasoning and analyzes how uncertainty visualizations can support cognitive and meta-cognitive processes. Uncertainty in data is paralleled by uncertainty in reasoning processes, and while uncertainty in data is starting to get some of the visualization research attention it deserves, the uncertainty in the reasoning process is thus far often overlooked. While concurring with the importance of incorporating data uncertainty visualizations, we suggest also developing closely integrated visualizations that provide support for uncertainty in reasoning.
Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration
Authors: Benny Akesson, Liesbeth Steffens, Eelke Strooisma, Kees Goossens
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

The convergence of application domains in new systems-on-chip (SoC) results in systems with many applications with a mix of soft and hard real-time requirements. To reduce cost, resources, such as memories and interconnect, are shared between applications. However, resource sharing introduces interference between the sharing applications, making it difficult to satisfy their real-time requirements. Existing arbiters do not efficiently satisfy the requirements of applications in SoCs, as they either couple rate or allocation granularity to latency, or cannot run at high speeds in hardware with a low-cost implementation.The contribution of this paper is an arbiter called Credit-Controlled Static-Priority (CCSP), consisting of a rate regulator and a static-priority scheduler. The rate regulator isolates applications by regulating the amount of provided service in a way that decouples allocation granularity and latency. The static-priority scheduler decouples latency and rate, such that low latency can be provided to any application, regardless of the allocated rate. We show that CCSP belongs to the class of latency-rate servers and guarantees the allocated rate within a maximum latency, as required by hard real-time applications. We present a hardware implementation of the arbiter in the context of a DDR2 SDRAM controller. An instance with six ports running at 200 MHz requires an area of 0.0223 mm2in a 90 nm CMOS process.
Binary-Decision-Based Programmable Controllers
Authors: Paul A. Zsombor-murray, Louis Vroomen, Robert Hudson, Tho Le-Ngoc, Peter Holck
Venue: IEEE Micro (1983)

In certain applications, a microcomputer system employing one or more peripheral binary-decision-based controllers can react more quickly than a system using conventional microprocessor-based controllers.
Cryptanalysis of LASH
Authors: Ron Steinfeld, Scott Contini, Krystian Matusiewicz, Josef Pieprzyk, Jian Guo, San Ling, Huaxiong Wang
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7). Moreover, we briefly mention heuristic lattice based collision attacks that use small memory but require very long messages that are expected to find collisions much faster than 2 x/2. All of these attacks exploit the designers' choice of an all zero IV.We then consider whether LASH can be patched simply by changing the IV. In this case, we show that LASH is vulnerable to a 2(7x/8) preimage attack. We also show that LASH is trivially not a PRF when any subset of input bytes is used as a secret key. None of our attacks depend upon the particular contents of the LASH matrix --- we only assume that the distribution of elements is more or less uniform.Additionally, we show a generalized birthday attack on the final compression of LASH which requires $O\left(x2^{\frac{x}{2(1+\frac{107}{105})}}\right) \approx O(x2^{x/4})$ time and memory. Our method extends the Wagner algorithm to truncated sums, as is done in the final transform in LASH.
Condition number analyses of line/surface and surface/surface intersection algorithms
Authors: Stephen A. Vavasis
Venue:  (2008)

Intersection problems have many applications in computational geometry and geometric modeling and design. This dissertation addresses two specific intersection problems: finding all intersections between a line and a parametric surface and between two parametric surfaces. New algorithms based on Newton's method and subdivision are proposed to solve these problems. Our algorithms also use a test based on the Kantorovich theorem to prevent the divergence or slow convergence issues normally associated with using unsuitable starting points for Newton's method. The algorithm for line/surface problem in particular can operate on polynomials represented in any basis that satisfies a few conditions. The power basis, Bernstein, and first-kind Chebyshev bases are among those compatible with the algorithm. The novelty of our algorithms is the analyses showing that their running time is bounded only in terms of the condition number of the problem instance and, in the line/surface case, the constant depending on the polynomial basis. This constant measures the tightness of the bounding polytope as compared to the bounded subsurface, which translates to the efficiency of the algorithm when the basis is used. The constant is different for each basis as each one lends itself to computation of different bounding polytope. We derive this constant for the three mentioned commonly used bases.
Private Information: To Reveal or not to Reveal
Authors: Danfeng Yao, Keith B. Frikken, Mikhail J. Atallah, Roberto Tamassia
Venue: ACM Transactions on Information and System Security (TISSEC) (2008)

This article studies the notion of quantitative policies for trust management and gives protocols for realizing them in a disclosure-minimizing fashion. Specifically, Bob values each credential with a certain number of points, and requires a minimum total threshold of points before granting Alice access to a resource. In turn, Alice values each of her credentials with a privacy score that indicates her degree of reluctance to reveal that credential. Bob's valuation of credentials and his threshold are private. Alice's privacy-valuation of her credentials is also private. Alice wants to find a subset of her credentials that achieves Bob's required threshold for access, yet is of as small a value to her as possible. We give protocols for computing such a subset of Alice's credentials without revealing any of the two parties' above-mentioned private information. Furthermore, we develop a fingerprint method that allows Alice to independently and easily recover the optimal knapsack solution, once the computed optimal value is given, but also enables verification of the integrity of the optimal value. The fingerprint method is useful beyond the specific authorization problem studied, and can be applied to any integer knapsack dynamic programming in a private setting.
Eye, Robot: A Network Control System for Ophthalmologic Examination
Authors: Kentaro Go, Kenji Kashiwagi, Yuki Ito, Yu Nakazawa, Jumpei Arata
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

This paper reports an iterative design project of a network control system to support ophthalmologic examination, for use in support of telemedicine. The project is a case study of development and deployment of a telemedicine system through human-centered design approaches. At the early stage of design, we carried out field research and paper prototyping on the network control system with ophthalmologists. Then, we developed working prototypes for conducting usability tests and field tests. We examine lessons learned from the design process and the designed product.
Arthur and Merlin as Oracles
Authors: Venkatesan T. Chakaravarthy, Sambuddha Roy
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We study some problems solvable in deterministic polynomial time given oracle access to the promise version of the Arthur-Merlin class AM. The main result is that ${{\rm BPP}^{\rm NP}_{||}} \subseteq {{\rm P}^{{{\rm pr}{\rm AM}}}_{||}}$. An important property of the class ${{\rm P}^{{{\rm pr}{\rm AM}}}_{||}}$ is that it can be derandomized as ${{\rm P}^{{{\rm pr}{\rm AM}}}_{||}}={{\rm P}^{\rm NP}_{||}}$, under a natural hardness hypothesis used for derandomizing the class AM; this directly follows from a result due to Miltersen and Vinodchandran [10]. As a consequence, we get that ${{\rm BPP}^{{\rm NP}}_{||}} = {{\rm P}^{\rm NP}_{||}}$, under the above hypothesis. This gives an alternative (and perhaps, a simpler) proof of the same result obtained by Shaltiel and Umans [16], using different techniques.Next, we present an FPprAM algorithm for finding near-optimal strategies of a succinctly presented zero-sum game. For the same problem, Fortnow et al. [7] described a ZPPNP algorithm. As a by product of our algorithm, we also get an alternative proof of the result by Fortnow et. al. One advantage with an FPprAM algorithm is that it can be directly derandomized using the Miltersen-Vinodchandran construction [10]. As a consequence, we get an FPNP algorithm for the above problem, under the hardness hypothesis used for derandomizing AM.
How to Write a Universal Cross-Assembler
Authors: J. Heath, Shailesh Patel
Venue: IEEE Micro (1981)

Most microprocessors require their own cross-assemblers-an expensive proposition for organizations with a variety of micros. What's the answer? A universal one-pass cross-assembler.
Analysis of Linux Scheduling with VAMPIR
Authors: Michael Kluge, Wolfgang E. Nagel
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Analyzing the scheduling behavior of an operating system becomes more and more interesting because multichip mainboards and Multi-Core CPUs are available for a wide variety of computer systems. Those system can range from a few CPU cores to thousands of cores. Up to now there is no tool available to visualize the scheduling behavior of a system running Linux. The Linux Kernel has an unique implementation of threads, each thread is treated as a process. In order to be able to analyze scheduling events within the kernel we have developed a method to dump all information needed to analyze process switches between CPUs into files. These data will then be analyzed using the VAMPIR tool. Traditional VAMPIR displays will be reused to visualize scheduling events. This approach allows to follow processes as they switch between CPUs as well as gathering statistical data, for example the the number of process switches.
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
Authors: Eric I. Hsu, Christian J. Muise, J. Christopher Beck, Sheila A. Mcilraith
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a variable a particular value. Intuitively such constructs would seem important to efficient search, but their study to date has been from a mostly conceptual perspective, in terms of indicating problem hardness or motivating and interpreting heuristics. Here we summarize a two-phase project where we first measure the ability of both existing and novel probabilistic message-passing techniques to directly estimate bias and identify backbones for the Boolean Satisfiability (SAT) Problem. We confirm that methods like Belief Propagation and Survey Propagation---plus Expectation Maximization-based variants---do produce good estimates with distinctive properties. The second phase demonstrates the use of bias estimation within a modern SAT solver, exhibiting a correlation between accurate, stable, estimates and successful backtracking search. The same process also yields a family of search heuristics that can dramatically improve search efficiency for the hard random problems considered.
Lung Tissue Classification in HRCT Data Integrating the Clinical Context
Authors: Adrien Depeursinge, Jimison Iavindrasana, Gilles Cohen, Alexandra Platon, Pierre-Alexandre Poletti, Henning Müller
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

In this paper, we investigate the influence of the clinical context of high–resolution computed tomography (HRCT) images of the chest on tissue classification. Evaluation of the classification performance is based on high–quality visual data extracted from clinical routine. The clinical attributes with highest information gain ratio show to be relevant and consistent for the classification of lung tissue patterns. A combination of visual and clinical attributes allowed a mean of 93% correct predictions of testing instances among the five classes of lung tissue with optimized support vector machines (SVM), which represents a significant benefit of 8% compared to a pure visually–based classification.
Heuristic Algorithms for Solving Uncertain Routing-Scheduling Problem
Authors: Jerzy Józefczyk, Michał Markowski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

A combined routing-scheduling problem is considered in the paper. It consists in scheduling of tasks on moving executors. The case with non-preemptive and independent tasks, unrelated executors as well as interval execution times to minimize the makespan is investigated. The worst-case scheduling problem based on an absolute regret is formulated. Solution algorithms of polynomial computational complexity, which use simulated annealing as well as tabu search approaches, are presented. The results of numerical experiments are given.
HeCaSe2: A Multi-agent Ontology-Driven Guideline Enactment Engine
Authors: David Isern, David Sánchez, Antonio Moreno
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

HeCaSe2 is a multi-agent system that intends to help doctors to apply clinical guidelines to their patients in a semi-automatic fashion. HeCaSe2 agents need a lot of (scattered) information on health care organisations, as well as medical knowledge, in order to provide an efficient support to health care practitioners. Modelling all these data is certainly a hard task. The paper describes how the inclusion of an especially designed ontology allows different agents to coordinate their activities in the enactment of clinical guidelines.
Estimating Light Vectors in Real Time
Authors: Wai-Man Pang, Tien-Tsin Wong, Pheng-Ann Heng
Venue: IEEE Computer Graphics and Applications (2004)

The determination of the light vector is important for capturing the surface appearance under different illumination conditions. This is necessary for bi-directional reflectance distribution function measurement, texture acquisition, and image-based data acquisition. Most current systems adopt mechanical setup to control the light source position and direction. However, the setup is usually expensive and not portable. It also imposes limitation on the size of object being captured. This article proposes a capturing system that estimates the light vector by applying a vision-based technique. The user can freely move a handheld light source during capture. The light vector is estimated in real-time through a Web cam mounted on the light source. This application acquires image-based data for relighting. Also presented is a discussion on how the captured data is processed and compressed to a manageable form.
On Δ-convergence theorems in CAT(0) spaces
Authors: S. Dhompongsa, B. Panyanak
Venue: Computers Mathematics with Applications (2008)

By using the concept of @?-convergence introduced by Lim [T.C. Lim, Remarks on some fixed point theorems, Proc. Amer. Math. Soc. 60 (1976) 179-182], we are able to give the CAT(0) space analogs of results on weak convergence of the Picard, Mann and Ishikawa iterates proved in uniformly convex Banach spaces by Opial [Z. Opial, Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bull. Amer. Math. Soc. 73 (1967) 591-597], Ishikawa [S. Ishikawa, Fixed points and iteration of a nonexpansive mapping in a Banach space, Proc. Amer. Math. Soc. 59 (1976) 65-71] and Tan and Xu [K.K. Tan, H.K. Xu, Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process, J. Math. Anal. Appl. 178 (1993) 301-308].
Extensive investigations of temperature influence on barrier integrity during reliability testing
Authors: O. Aubel, M. A. Meyer, F. Feustel, H. J. Engelmann, I. Zienert, J. Poppe, H. Schmidt, D. Gehre, H. Geisler, E. Langer, P. Limbecker, T. Foltyn, C. Witt, W. Yao, S. Thierbach, F. Koschinsky, C. Zistl
Venue: Microelectronic Engineering (2008)

Investigation of stress migration phenomena is one of the key aspects to characterize metallization reliability. Typical test methodologies are investigations of resistance shifts at wafer-level or package-level temperature storage tests under a temperature range between 150^oC and 275^oC. During these tests a very limited resistance increase dependent on the test structure is allowed. Most recently we encounter unusual resistance shift at the highest stress temperature which did not yield classical stress voiding detectable by failure analysis. We found changes in barrier integrity explaining the resistance shift by barrier oxidization. This has been verified by specially prepared material as well as extensive failure analysis investigation.
Resource Bundles: Using Aggregation for Statistical Wide-Area Resource Discovery and Allocation
Authors: Michael Cardosa, Abhishek Chandra
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Resource discovery is an important process for finding suitable nodes that satisfy application requirements in large loosely-coupled distributed systems. Besides inter-node heterogeneity, many of these systems also show a high degree of intra-node dynamism, so that selecting nodes based only on their recently observed resource capacities for scalability reasons can lead to poor deployment decisions resulting in application failures or migration overheads. In this paper, we propose the notion of a resource bundle ---a representative resource usage distribution for a group of nodes with similar resource usage patterns --- that employs two complementary techniques to overcome the limitations of existing techniques: resource usage histograms to provide statistical guarantees for resource capacities, and clustering-based resource aggregation to achieve scalability. Using trace-driven simulations and data analysis of a month-long Planet Lab trace, we show that resource bundles are able to provide high accuracy for statistical resource discovery (up to 56% better precision than using only recent values), while achieving high scalability (up to 55% fewer messages than a non-aggregation algorithm). We also show that resource bundles are ideally suited for identifying group-level characteristics such as finding load hot spots and estimating total group capacity (within 8% of actual values).
Preliminary Application of the First Digital Chinese Human
Authors: Yuan Yuan, Lina Qi, Shuqian Luo
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

A great deal of work has been attempted and accomplished based on VCH-F1 (the No.1 Virtual Chinese Human-Female) dataset these years. So far, the anatomic structures of the whole body have been 3D reconstructed and a varieties of further work such as health science education facilities, virtual acupuncture, image-guided neurosurgery, motion simulation etc. have also been developed and preliminarily implemented. In this paper, we will describe the application study of VCH-F1 dataset in our laboratory.
Investigating methods for improving bagged k-NN classifiers
Authors: Fuad M. Alkoot
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

We experiment with bagging kNN classifiers using an optimal distance metric. The aim is to establish whether bagging kNN is useful when a better metric is used. We experiment on real world data sets, at different training set sizes. Our experiments also involve Modified bagging, which was proposed by us, to see the effect of prior knowledge on the bagging performance under the new distance measure. Results indicate the optimal metric improves the performance of bagging as well as the single classifier.
Interval Additive Generators of Interval T-Norms
Authors: G. P. Dimuro, B. C. Bedregal, R. H. Reiser, R. H. Santiago
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

The aim of this paper is to introduce the notion of interval additive generators of interval t-norms as interval representations of additive generators of t-norms, considering both the correctness and the optimality criteria, in order to provide a more systematic methodology for the selection of interval t-norms in the various applications. We prove that interval additive generators satisfy the main properties of punctual additive generators discussed in the literature.
Multi-objective Optimal Public Investment: An Extended Model and Genetic Algorithm-Based Case Study
Authors: Lei Tian, Liyan Han, Hai Huang
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Under the multi-region and multi-sector consideration, the previous double-objective optimal public investment model is extended to involve optimal employment rate objective and time-flow total income maximization objective first. Then genetic algorithm is applied to solve the multi-objective model. Finally a case study is carried out to verify the superiority of the genetic algorithm-based solution to traditional public investment distribution approach.