ppxscal/embedding_network huggingface dataset:
On Quality Of Service Routing in Ad-Hoc Networks
Authors: Jaydeep Punde, Niki Pissinou, Kia Makki
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Ad-hoc networks can be formally defined as acollection of wireless mobile hosts dynamically forminga temporary network without the aid of any existingestablished infrastructure or centralized admission[1].The main focus of the paper is the extension to the QoSrouting procedure, which can inform the source qualityof service available to any destination in the wirelessnetwork. The Ad-Hoc On Demand Distance VectorRouting Protocol (AODV) is taken into considerationand an extension to the protocol has been suggested tosupport Quality of Service.
The design and implementation of a parser and front-end for the iso c++ language and validation of the parser
Authors: Brian A. Malloy
Venue:  (2003)

In this thesis, we address the problems associated with the early phases of compiler development for object-oriented languages: lexical analysis, parsing and construction of a parser front-end. We first show that many language constructs for object-oriented languages cannot be parsed using only syntactic information. We then describe a technique for parsing ambiguous language constructs that exploits semantic information previously gathered in the parse. To demonstrate the effectiveness of the technique we apply it to a language that is notoriously difficult to parse, the C++ programming language. We show that the technique permits parsing of ambiguous C++ constructs in the grammar provided in the ISO C++ standard without modifying, refactoring or extending the grammar. We then describe a dynamic, automated technique for validating the parser, including the development of a technique that permits validation of class invariants that are not initially valid. The algorithm for this technique accepts, as input, a formal specification of the invariants for the important classes and class hierarchies in the system. The algorithm produces, as output, a validator that exercises these invariants as part of the testing process.
A System Level Exploration Platform and Methodology for Network Applications Based on Configurable Processors
Authors: D. Quinn, B. Lavigueur, G. Bois, M. Aboulhamid
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

A recent practice in the development of programmable SoC is the integration of configurableprocessors, since they offer an interesting compromise between purely software and hardware solutions. This paper proposes an adjustment to the current codesign approach to integrate this opportunity at the partitioning level. Since configurable processors seem to be an interesting option for NPU designs, we integrated into a system level exploration platform the support of an Xtensa processor for more investigation. As case studies, this paper illustrates the methodology for two realistic network-processing applications, for which interesting performances are obtained.
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
Authors: Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
Venue: SIAM Journal on Computing (2004)

Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call minimum conflict-free coloring (min-CF-coloring). In its general form, the input of the min-CF-coloring problem is a set system $(X,{\cal S})$, where each $S \in {\cal S}$ is a subset of X. The output is a coloring $\chi$ of the sets in ${\cal S}$ that satisfies the following constraint: for every $x \in X$ there exists a color $i$ and a unique set $S \in {\cal S}$ such that $x \in S$ and $\chi(S) = i$. The goal is to minimize the number of colors used by the coloring $\chi$. Min-CF-coloring of general set systems is not easier than the classic graph coloring problem. However, in view of our motivation, we consider set systems induced by simple geometric regions in the plane. In particular, we study disks (both congruent and noncongruent), axis-parallel rectangles (with a constant ratio between the smallest and largest rectangle), regular hexagons (with a constant ratio between the smallest and largest hexagon), and general congruent centrally symmetric convex regions in the plane. In all cases we have coloring algorithms that use O(log n) colors (where n is the number of regions). Tightness is demonstrated by showing that even in the case of unit disks, $\Theta(\log n)$ colors may be necessary. For rectangles and hexagons we also obtain a constant-ratio approximation algorithm when the ratio between the largest and smallest rectangle (hexagon) is a constant. We also consider a dual problem of CF-coloring points with respect to sets. Given a set system $(X,{\cal S})$, the goal in the dual problem is to color the elements in X with a minimum number of colors so that every set $S \in {\cal S}$ contains a point whose color appears only once in S. We show that O(log |X|) colors suffice for set systems in which X is a set of points in the plane and the sets are intersections of X with scaled translations of a convex region. This result is used in proving that O(log n) colors suffice in the primal version.
CHI 2004
Authors: Marisa Campbell
Venue: interactions (2004)

April 24-29, 2004<br>Vienna, Austria
Comment on a paper of R. A. Freiburghouse
Authors: J. V. Peschke
Venue: ACM SIGPLAN Notices (1978)

This is a comment on the paper 'Proposed Extension~to PL/I for Real-Time Applications' which appeared in SIGPLAN-Notices in July 1977 (pages 26--42). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Opinion: Silicon Superstitions
Authors: Jef Raskin
Venue: Queue (2003)

We live in a technological age. Even most individuals on this planet who do not have TV or cellular telephones know about such gadgets of technology. They are artifacts made by us and for us. You’d think, therefore, that it would be part of our common heritage to understand them. Their insides are open to inspection, their designers generally understand the principles behind them, and it is possible to communicate this knowledge—even though the “theory of operation” sections of manuals, once prevalent, seem no longer to be included. Perhaps that’s not surprising considering that manuals themselves are disappearing, leaving behind glowing Help screens that too often are just reference material for the cognoscenti rather than guides for the perplexed.
Feature Maps: A New Approach in Hierarchical Interpretation of Images
Authors: Andrzej Sluzek
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The paper introduces hierarchical image transformationsthat can be used for detecting various image features ofgradually increased complexity. The major prospectiveapplication of the method is in (semi-) autonomous vision-guidedrobotic systems and, therefore, the local operatorsthat can be prospectively hardware-implemented are thecore component of the proposed algorithms.A feature map is a grey-level digital image with a vectorattached to each pixel. Pixel intensities represent "thefeature intensity", i.e. the estimated confidence that afeature of interest is located at the pixel. The vectorcomponents are characterizing the feature configuration.The low-level "intensity map" is the original grey-levelimage with the "feature intensity" being just thebrightness value. A transformation from the currentfeature map to the map of a higher level is obtained byapplying a local operator (with a circular scanningwindow). For each location of the window, the operatordetermines the template instance of a higher-level featureprospectively existing at this location. Then, the templateis matched to the actual content of the window and -based on their similarity - the feature intensity value forthe higher-level map pixel is determine. The associatedvectors are containing the configuration parameters of thetemplates extracted by the operator.The paper contains the theoretical foundations of theproposed method, but exemplary results illustrating themethod's principles are also provided.
Parametric polymorphism and operational equivalence
Authors: Andrew M. Pitts
Venue: Mathematical Structures in Computer Science (2000)

Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard&ndash;Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where the partialness arising from the presence of fixpoint recursion complicates the nature of potentially infinite (&lsquo;lazy&rsquo;) data types. An approach to Reynolds' notion of relational parametricity is developed that works directly on the syntax of a programming language, using a novel closure operator to relate operational behaviour to parametricity properties of types. Working with an extension of Plotkin's PCF with &forall;-types, lazy lists and existential types, we show by example how the resulting logical relation can be used to prove properties of polymorphic types up to operational equivalence.
Hereditary dominating pair graphs
Authors: Nataša Pržulj, Derek G. Corneil, Ekkehard Köhler
Venue: Discrete Applied Mathematics (2004)

An asteroidal triple (AT) is a set of vertices such that each pair of vertices is joined by a path that avoids the neighborhood of the third. Every AT-free graph contains a dominating pair, a pair of vertices such that for every path between them, every vertex of the graph is within distance one of the path. We say that a graph is a hereditary dominating pair (HDP) graph if each of its connected induced subgraphs contains a dominating pair. In this paper we introduce the notion of frame HDP graphs in order to capture the structure of HDP graphs that contain asteroidal triples. We also determine the maximum diameter of frame HDP graphs.
Traceability of Double Spending in Secure Electronic Cash System
Authors: Hyun Ju Lee, Mun Suk Choi, Chung Sei Rhee
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

With a widespread deployment of Internet and Mobile communication skill, digital contents circulation has been in active. However, when people purchase multimedia contents such as multimedia books, online game, music, etc., by credit card, it has a problem that reveals cardholder's private information. On the other hand, electronic cash provide user's anonymity and privacy, maintaining the value of paper money and its characteristics.In this paper, we propose an algorithm which uses the fair blind signature, supporting legitimate users' anonymity, it also has a function which can cancel the anonymity against double spending in electronic cash.
Distributed Analysis: The Last Frontier?
Authors: Jorge Audy, Roberto Evaristo, Mary Beth Watson-Manheim
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

It is widely agreed that the trend toward distributed software development is growing.Although there are difficulties involved, this trend is here to stay, as organizations will continue to search for ways to develop software at lower cost but with same quality. Current research has focused primarily on the later stages of the software development life cycle, especially coding of software requirements. However, as organizations become more virtual, distributed development will become more apparent throughout the entire life cycle. In this study, we investigate distributed analysis in software development.We report on results from a field experiment with two graduate level Information Systems classes, one located in Porto Alegre, Brazil and one in Chicago, U.S. The students in Brazil played the role of users whereas the students in Chicago role-played analysts. The Chicago-based students developed a requirements document for an information system byinterviewing the Brazil students using an electronic discussion board. Our findings provide insight into the distributed analysis process and identify sources of potential problems.
Puzzles in software development contracting
Authors: Yossi Lichtenstein
Venue: Communications of the ACM (2004)

Current outsourcing practices are relatively unsophisticated in comparison with the techniques prescribed by economic theory. Customers end up bearing all long-term risk, and vendors have no direct incentive to achieve long-term system effectiveness.
Improved force-directed scheduling
Authors: W. F. J. Verhaegh, E. H. L. Aarts, J. H. M. Korst, P. E. R. Lippens
Venue: Proceedings of the conference on European design automation (1991)

We present a mathematical justification of the technique of force-directed scheduling and propose two modifications of the basis algorithm introduced by Paulin and Knight. The newly presented modifications improve the effectiveness of force-directed scheduling without affecting its time complexity. This is illustrated by an empirical performance analysis based on a number of problem instances.
Speeding up the FMMR perfect sampling algorithm: a case study revisited
Authors: Robert P. Dobrow, James Allen Fill
Venue: Random Structures Algorithms (2003)

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms--one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling--are compared using as a case study the move-to-front (MTF) self-organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user-chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, tile running time for CFTP grows exponentially in n.
Simulation of parallel and distributed systems scheduling
Authors: Helen D. Karatza
Venue: Applied system simulation: methodologies and applications (2003)

This chapter considers the problem of scheduling parallel and distributed computer systems. Several scheduling policies are presented that are employed in these two multiprocessor system types which address different aspects of the scheduling problem. It is shown that simulation is a valuable tool used by many researchers to evaluate the performance of different scheduling methods.
Shadowed sets and related algebraic structures
Authors: Gianpiero Cattaneo, Davide Ciucci
Venue: Fundamenta Informaticae (2002)

BZMVdM algebras are introduced as an abstract environment to describe both shadowed and fuzzy sets. This structure is endowed with two unusual complementations: a fuzzy one ¬ and an intuitionistic one ∼. Further, we show how to define in any BZMVdM algebra the Boolean subalgebra of exact elements and to give a rough approximation of fuzzy elements through a pair of exact elements using an interior and an exterior mapping.Then, we introduce the weaker notion of pre-BZMVdM algebra. This structure still have as models fuzzy and shadowed sets but with respect to a weaker notion of intuitionistic negation ∼α with α ∈ [0, ½). In pre-BZMVdM algebras it is still possible to define an interior and an exterior mapping but, in this case, we have to distinguish between open and closed exact elements.Finally, we see how it is possible to define α-cuts and level fuzzy sets in the pre-BZMVdM algebraic context of fuzzy sets.
Customer Loyalty and Supplier Quality Competition
Authors: Noah Gans
Venue: Management Science (2002)

We develop a model of customer choice in response to random variation in quality. The choice model yields closed-form expressions which reflect the effect of competing suppliers' service quality on the long-run fraction of purchases a customer makes at the various competitors. We then use the expressions as the basis of simple normative models for suppliers seeking to maximize their long-run average profits. The results provide insight into the effect of switching behavior on the service levels offered by competing suppliers.
Solving Degenerate Reaction-Diffusion Equations via Variable Step Peaceman-Rachford Splitting
Authors: H. Cheng, P. Lin, Q. Sheng, R. C. E. Tan
Venue: SIAM Journal on Scientific Computing (2003)

This paper studies the numerical solution of two-dimensional nonlinear degenerate reaction-diffusion differential equations with singular forcing terms over rectangular domains. The equations considered may generate strong quenching singularities. This investigation focuses on a variable time step Peaceman--Rachford splitting method for the aforementioned problem. The time adaptation is implemented based on arc-length estimations of the first time derivative of the solution. The two-dimensional problem is split into several one-dimensional problems so that the computational cost is significantly reduced. The monotonicity and localized linear stability of the variable step scheme are investigated. We give some numerical examples to illustrate our results as well as to demonstrate the viability and efficiency of the method over existing methods for the quenching problem. It is also shown that the numerical solution obtained preserves important properties of the physical solution of the given problem.
Sequence Modeling with Mixtures of Conditional Maximum Entropy Distributions
Authors: Dmitry Pavlov
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We present a novel approach to modeling sequences usingmixtures of conditional maximum entropy (maxent) distributions.Our method generalizes the mixture of first-orderMarkov models by including the "long-term" dependenciesin model components.The "long-term" dependenciesare represented by the frequently used in the naturallanguage processing (NLP) domain probabilistic triggersor rules (suc as "A occured k positions back" \Longrightarrow"the current symbol is B" with probability P).The maxentframework is then used to create a coherent global probabilisticmodel from all selected triggers.In this paper, weenhance this formalism by using probabilistic mixtures withmaxent models as components, thus representing hidden orunobserved effects in the data.We demonstrate how ourmixture of conditional maxent models can be learned fromdata using the generalized EM algorithm that scales linearlyin the dimensions of the data and the number of mixturecomponents.We present empirical results on the simulatedand real-world data sets and demonstrate that theproposed approach enables us to create better quality modelsthan the mixtures of first-order Markov models and resistoverfitting and curse of dimensionality that would inevitablypresent themselves for the higher order Markov models.
A Framework for Tamper Detection Marking of Mobile Applications
Authors: Mike Jochen, Lisa M. Marvel, Lori L. Pollock
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Today's applications are highly mobile; we downloadsoftware from the Internet, machine executable code arrivesattached to electronic mail, and Java applets increase thefunctionality and appearance of web pages. This movementhas stirred a great deal of research in the area of mobilecode security. The fact remains that a newly arrived programto a local host has the potential to inflict significantdamage to the local host and local resources. Perhaps thenew program originated from a charlatan host masqueradingas a trusted server, or has been modified by a maliciousparty during transit from the trusted server to the local host.In light of this risk, security models that address mobilecode are in high demand. We have developed a frameworknamed SECRYT, which enables users of a mobile applicationto validate the application with integrity and authenticationdata while simplifying the management and distributionof the authentication data.
Learning Generalized Policies from Planning Examples Using Concept Languages
Authors: Mario Martín, Hector Geffner
Venue: Applied Intelligence (2004)

In this paper we are concerned with the problem of learning how to solve planning problems in one domain given a number of solved instances. This problem is formulated as the problem of inferring a function that operates over all instances in the domain and maps states and goals into actions. We call such functions generalized policies and the question that we address is how to learn suitable representations of generalized policies from data. This question has been addressed recently by Roni Khardon (Technical Report TR-09-97, Harvard, 1997). Khardon represents generalized policies using an ordered list of existentially quantified rules that are inferred from a training set using a version of Rivest's learning algorithm (Machine Learning, vol. 2, no. 3, pp. 229&ndash;246, 1987). Here, we follow Khardon's approach but represent generalized policies in a different way using a concept language. We show through a number of experiments in the blocks-world that the concept language yields a better policy using a smaller set of examples and no background knowledge.
An optimization algorithm using orthogonal arrays in discrete design space for structures
Authors: Kwon-Hee Lee, Jeong-Wook Yi, Joon-Seong Park, Gyung-Jin Park
Venue: Finite Elements in Analysis and Design (2003)

Structural optimization has been carried out in continuous or discrete design space. Methods for discrete design such as genetic algorithms are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is proposed for design in discrete space. An orthogonal array is selected on a discrete design space and levels are chosen from candidate values. Matrix experiments with the orthogonal array are conducted. A characteristic function is defined to consider the constraint feasibility. A new design in a certain iteration is determined from analysis of means (ANOM) with the characteristic function. An orthogonal array is defined around the new values and matrix experiments are conducted again with the new orthogonal array. The final optimum design is found from the iterative process. Various structural problems are solved to show the validity of the proposed method. The results are compared with those from a genetic algorithm and discussed.
A comparison of end user and expert system quality assessments
Authors: Tanya J. McGill
Venue: Advanced topics in end user computing (2003)

Organizations rely heavily on applications developed by end users, yet lack of experience and training may compromise the ability of end users to make objective judgments about the quality of their applications. The study reported on in this chapter investigated the ability of end users to assess the quality of applications they develop. The results confirm that there are differences between the system quality assessments of end user developers and independent expert assessors. In particular, the results of this study suggest that end users with little experience may erroneously consider the applications they develop to be of high quality. Some implications of these results are discussed.