ppxscal/embedding_network huggingface dataset:
Context representation, transformation and comparison for ad hoc product data exchange
Authors: Jingzhi Guo, Chengzheng Sun
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

Product data exchange is the precondition of business interoperation between Web-based firms. However, millions of small and medium sized enterprises (SMEs) encode their Web product data in ad hoc formats for electronic product catalogues. This prevents product data exchange between business partners for business interoperation. To solve this problem, this paper has proposed a novel concept-centric catalogue engineering approach for representing, transforming and comparing semantic contexts in ad hoc product data exchange. In this approach, concepts and contexts of product data are specified along data exchange chain and are mapped onto several novel XML product map (XPM) documents by utilizing XML hierarchical structure and its syntax. The designed XPM has overcome the semantic limitations of XML markup and has achieved the semantic interoperation for ad hoc product data exchange.
Using backward strategy to the Needham-Schroeder public key protocol verification
Authors: Mirosław Kurkowski, Witold Mac´ków
Venue: Artificial intelligence and security in computing systems (2003)

When dealing with secure distributed systems it is essential that entities (principals, persons, hosts, computers, etc.) are able to prove their identities to each other. The process of proving the identity is called entity authentication. Cryptographic protocols are very good tools to achieve this goal. These protocols are precisely defined sequences of communication and computation steps that use some mechanism such as encryption and decryption. In this paper we present applying a new fast method of verification of cryptographic authentication protocols to verification of the Needham-Schroeder Public Key Authentication Protocol. We present a verification algorithm, its implementation and some experimental results. Our method is a kind of model checking. To decrease the number of states in the space, which describe executions of authentication protocols in real net, we use a partial order reduction. For the verification of correctness property we apply a backward induction method.
Exploiting direct-access networking in network-attached storage systems
Authors: Margo Seltzer
Venue:  (2003)

In recent years network storage has emerged as an important systems research field, driven by the demand for scalable storage structures to satisfy the growing needs of Internet services. With the advent of high-speed networks, the efficiency of network storage systems is directly related to the host CPU overhead of communication protocols for a large class of applications. This thesis addresses the question of what system support is necessary to reduce the communication overhead of network file systems in common use, while interoperating with existing, widely deployed network infrastructure. It demonstrates that significant host CPU overhead reduction is possible with appropriate network interface support, and shows that two novel network mechanisms are equally effective in reducing overhead for large I/Os; one of them, however, has the additional advantage of reducing server overhead for small I/Os. In addition to aiming for overhead reduction, an appropriately designed API is necessary to provide applications with control over I/O policy. This thesis addresses the question of whether a kernel implementation of such an API can enable high performance implementations of user-level services while retaining the benefit of protection and fault isolation provided by the user-kernel boundary. It shows that a kernel implementation of an I/O API has comparable overhead to a user-level implementation of the same API and that both enable high-performance network attached storage services.
The economic and social impact of electronic commerce in developing countries
Authors: Roberto Vinaja
Venue: The economic and social impacts of e-commerce (2003)

The chapter addresses the potential benefits of Electronic Commerce to developing countries. Electronic commerce has many potential benefits for developing countries (DC). In this chapter, the author describes the potential benefits of Electronic Commerce for developing nations and he provides case examples that illustrate this trend. The widespread adoption of electronic commerce is especially important for developing countries.
Current Mode, Voltage Mode, or Free Mode? A Few Sage Suggestions
Authors: Barrie Gilbert
Venue: Analog Integrated Circuits and Signal Processing (2004)

Many claims have been made about the benefits of a current-mode (CM) approach to IC design. The term is used to draw attention to some kind of special dependence on currents as signals, often without a clear orientation to the broader field, referring instead to recent CM papers. Its use suggests a significant and valuable distinction over &ldquo;conventional&rdquo; solutions, perhaps in the hope that this perspective, with an element of novelty at the cell level, will influence circuit design in the stringent context of IC production. This paper asks: What factors unambiguously define a current-mode circuit, and formally differentiate it from standard realizations of some function? Can one point to any compelling, and in the most favorable cases unique, advantages? Are these cells clearly of general value, capable of widespread utility? These issues are examined from the critical viewpoint that no circuits carry the entire functional burden by the exclusive use of either currents or voltages, and very few fully exploit the specific, but narrow, benefits of CM concepts. Real-world product development invariably demands the vigilant and full embrace of what might be called the Free Mode perspective, but merely as a mnemonic, not a classification.
Identify amino acid candidates critical for function of rat imidase by cross-reference voting in imidase superfamily
Authors: Chihan Lee, Ya-ting Lin, Chuan Yi Tang, Yuh-Shyong Yang
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

It is a useful strategy to understand structure-function relationship of proteins by aligning and analyzing their sequences. Database search techniques that can extract the functional or structural information from amino acid sequence are urgently needed. Imidase superfamily provides an interesting case for developing such method. Imidase super family contains a variety of related proteins that differ in functions and sequence identities. We developed a Cross-Reference Voting algorithm with complexity O(nm2), where n is the number of total sequences and m is the maximum lenght of the sequence, to identify amino acid candidates that are critical for function of rat imidase. After analyzing more than 80 members of imidase superfamily, several amino acid residues of rat imidase are selected and examined. His67, His69, Lys159, His192, His248 and Asp326 of rat imidase are found corresponding to critical residues of hydantoinase studied by site-directed mutagenesis and structure information of hydantoinase. His67, His69, Asp100, His217, His248, His420 and His459 of rat imidase are found corresponding to critical residues of dihydroorotase and allantoinase in separate studies. These results indicated that our algorithm could successfully extract functionally related amino acid candidates in imidase superfamily.
Connected Matroids with Symmetric Tutte Polynomials
Authors: Hongxun Qin
Venue: Combinatorics, Probability and Computing (2001)

We show that connected matroids with symmetric Tutte polynomials are not necessarily self-dual; in fact, we construct matroids that are not self-dual, have arbitrarily high connectivity, and yet have symmetric Tutte polynomials.
Identification of Discontinuous Coefficients in Elliptic Problems Using Total Variation Regularization
Authors: Tony F. Chan, Xue-Cheng Tai
Venue: SIAM Journal on Scientific Computing (2003)

We propose several formulations for recovering discontinuous coefficients in elliptic problems by using total variation (TV) regularization. The motivation for using TV is its well-established ability to recover sharp discontinuities. We employ an augmented Lagrangian variational formulation for solving the output-least-squares inverse problem. In addition to the basic output-least-squares formulation, we introduce two new techniques for handling large observation errors. First, we use a filtering step to remove as much of the observation error as possible. Second, we introduce two extensions of the output-least-squares model; one model employs observations of the gradient of the state variable while the other uses the flux. Numerical experiments indicate that the combination of these two techniques enables us to successfully recover discontinuous coefficients even under large observation errors.
A Framework for Low Power Audio Design
Authors: Nikolaus Voβ, Bärbel Mertsching
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Our goal is to develop a power-optimised technologyindependent macro-module library to support a fast andefficient design methodology for digital signal processinghardware. The library is embedded into a design-frameworkwhich supports an easy high-level data-flow oriented constructionof signal processing algorithms using abstractfunction prototypes and allows an automatic optimisationand verification. The macros implement a variety of architecturaland algorithmic transformations for DSP-functionsas well as basic arithmetic components. Our approachdiffers from existing high-level low-power synthesis toolsmainly in two points: Firstly, the framework embodies apsycho-acoustically motivated measurement of the outputsignal quality to ensure that the signal processing does notdistort the signal beyond a limit while allowing transformationsaffecting the overall signal quality. Secondly, bydefining hierarchy-levels for all modules, we can combinehigh level transformations for complex operations like filterswith a set of basic arithmetic macros implementing variousnumber representations and number systems like sign-magnitude,two's-complement or fixed- and floating pointnumbers and logarithmic and residue number systems.
Analysis of a bilinear finite element for shallow shells. II: consistency error
Authors: Ville Havu, Juhani Pitkäranta
Venue: Mathematics of Computation (2003)

We consider a bilinear reduced-strain finite element of the MITC family for a shallow Reissner-Naghdi type shell. We estimate the consistency error of the element in both membrane- and bending-dominated states of deformation. We prove that in the membrane-dominated case. under severe assumptions on the domain, the finite element mesh and the regularity of the solution, an error bound O(h + t-1h1+s) can be obtained if the contribution of transverse shear is neglected. Here t is the thickness of the shell, h the mesh spacing, and s a smoothness parameter. In the bending-dominated case, the uniformly optimal bound O(h) is achievable but requires that membrane and transverse shear strains are of order O(t2) as t → 0. In this case we also show that under sufficient regularity assumptions the asymptotic consistency error has the bound O(h).
Log-Concavity and the Spectral Gap of Stochastic Matrices
Authors: Ekkehard Weineck
Venue: Combinatorics, Probability and Computing (1997)

Let Q be a stochastic matrix and I be the identity matrix. We show by a direct combinatorial approach that the coefficients of the characteristic polynomial of the matrix I&minus;Q are log-concave. We use this fact to prove a new bound for the second-largest eigenvalue of Q.
An XML-based approach to combine firewalls and web services security specifications
Authors: Marco Cremonini, Sabrina De Capitani di Vimercati, Ernesto Damiani, Pierangela Samarati
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

The Web Services Architecture (WSA) defines a comprehensive model for service-oriented interactions among endpoints over a private network or the Internet. Since the many opportunities for better interacting services and the provision of richer functionality, crossing the boundary of organizations many standard proposals addressing different aspects of such interaction model are appearing. In this paper, we analyze the security requirements of the WSA and observe that the security model currently developed is not sufficient. In particular, we claim that many aspects related to network security and the integration of firewalls into the WSA have been understimated. We show with different examples the usefulness of a semantics-aware firewall operating both at SOAP level and at lower network-based layers. We analyze, under this perspective, the impact on security that recently proposed stateful SOAP-based protocols could have, and describe how asynchronous protocols could pose high security risks on both service providers and service requesters. This drives us to the conclusion that, if security is an enabling factor for the success of Web service technologies, then perimetral security and firewall technology should be both fully supported into the WSA and improved to satisfy the requirements of the service-oriented interaction.
At-Speed Built-in Self-Repair Analyzer for Embedded Word-Oriented Memories
Authors: Xiaogang Du, Wu-Tung Cheng
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

CRESTA is a built-in self-repair analyzer (BISRA)used for repair of bit-oriented memories, which canrepair all repairable bit-oriented memories with availablespare resource. This paper enhances CRESTA to supportembedded word-oriented memories. Within each readcycle of at-speed memory BIST, the analyzer is able tohandle multiple-bit failure in a word-oriented memory.Furthermore, to reduce area overhead, the proposedanalyzer is reconfigurable to process all repair strategiesin serial. To cover all repair strategies efficiently, wepropose a branch and bound algorithm to select repairstrategies.
A computer based letter formation system for children
Authors: Tony Nicol, Linda Snape
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

Learning to write requires letters to be formed using a particular sequence of pen strokes. Teachers are unable to continually monitor large numbers of children to ensure that they are using the correct sequence. A computer application has been developed to monitor the child's progress and provide appropriate feedback when required. This paper discusses the computer application which will be demonstrated to the conference delegates.
Executing a Minimum Number of Replications to Support the Reliability of FRTS Predictions
Authors: Dimosthenis Anagnostopoulos, Mara Nikolaidou
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

In faster-than-real-time simulation (FRTS), a valid model may be maintained in real time through comparing simulation results with the corresponding system observations at regular time intervals. As, in the general case, simulation does not reach a steady state within each such interval, experiments must involve multiple replications, which must be completed (i.e. reachpredictions) within the given time. In the past, methods have been introduced for examining the possibility of executing a specific number of replications, based on measurements obtained from a number of initial replications. We discuss how such a method may be applied, both in sequential and distributed simulation, for determining the maximum number of replications thatmay be executed in the given time. Nevertheless, n may be less than a minimum nmin required to support the reliability of results. To deal with this case, we need to decrease the time period for which predictions are made, to save up execution time. We propose method extensions for determining the time interval for which results may be reached by nmin replications. Experimental results from various models are presented to substantiate the validity and effectiveness of the proposed method.
MOLE: a sea-of-gates detailed router
Authors: Arvind Srinivasan, Ernest S. Kuh
Venue: Proceedings of the conference on European design automation (1990)

In this paper we present a new detailed router which was developed as part of a sea-of-gates layout project. It routes nets on two or more layers in a given rectangular or rectilinear region which may contain blockages and interior terminals in addition to terminals on the boundary. It uses a set of templates to perform routing and incorporates several novel features that address sea-of-gates routing issues. The router is very fast, memory efficient and yields excellent results.
What counts as success? punctuated patterns of use in a persistent chat environment
Authors: Christine A. Halverson, Thomas Erickson, Jeremy Sussman
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

This paper presents a case study of a globally distributed work group's use of an online environment called "Loops." Loops is a web-based persistent chat system whose aim is to support collaboration amongst corporate work groups. We describe the ways in which the group turned the system's features to its own ends, and the unusual usage rhythm that corresponded with the team's varying needs for communication as it moved through its work cycle. We conclude with a discussion of design implications, and a suggestion that "community" may not always be the best way to think about groups' use of online systems.
Extracting information about emotions in films
Authors: Andrew Salway, Mike Graham
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present a method being developed to extract information about characters' emotions in films. It is suggested that this information can help describe higher levels of multimedia semantics relating to narrative structures. Our method extracts information from audio description that is provided for the visually-impaired with an increasing number of films. The method is based on a cognitive theory of emotions that links a character's emotional states to the events in their environment. In this paper the method is described along with some preliminary evaluation and discussions about the kinds of novel video retrieval and browsing applications it may support.
Property testing: theory and applications
Authors: Sofya Raskhodnikova
Venue:  (2003)

Property testers are algorithms that distinguish inputs with a given property from those that are far from satisfying the property. Far means that many characters of the input must be changed before the property arises in it. Property testing was introduced by Rubinfeld and Sudan in the context of linearity testing and first studied in a variety of other contexts by Goldreich, Goldwasser and Ron. The query complexity of a property tester is the number of input characters it reads. This thesis is a detailed investigation of properties that are and are not testable with sublinear query complexity. We begin by characterizing properties of strings over the binary alphabet in terms of their formula complexity. Every such property can be represented by a CNF formula. We show that properties of n-bit strings defined by 2CNF formulas are testable with O( n ) queries, whereas there are 3CNF formulas for which the corresponding properties require &Omega;(n) queries, even for adaptive tests. We show that testing properties defined by 2CNF formulas is equivalent, with respect to the number of required queries, to several other function and graph testing problems. These problems include: testing whether Boolean functions over general partial orders are close to monotone, testing whether a set of vertices is close to one that is a vertex cover of a specific graph, and testing whether a set of vertices is close to a clique. Testing properties that are defined in terms of monotonicity has been extensively investigated in the context of the monotonicity of a sequence of integers and the monotonicity of a function over the m-dimensional hypercube {1,&hellip;,a}m. We study the query complexity of monotonicity testing of both Boolean and integer functions over general partial orders. We show upper and lower bounds for the general problem and for specific partial orders. A few of our intermediate results are of independent interest. (1) If strings with a property form a vector space, adaptive 2-sided error tests for the property have no more power than non-adaptive 1-sided error tests. (2) Random LDPC codes with linear distance and constant rate are not locally testable. (3) There exist graphs with many edge-disjoint induced matchings of linear size. In the final part of the thesis, we initiate an investigation of property testing as applied to images. We study visual properties of discretized images represented by n x n matrices of binary pixel values. We obtain algorithms with the number of queries independent of n for several basic properties: being a half-plane, connectedness and convexity. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
On sufficient conditions for unsatisfiability of random formulas
Authors: Albert Atserias
Venue: Journal of the ACM (JACM) (2004)

A descriptive complexity approach to random 3-SAT is initiated. We show that unsatisfiability of any significant fraction of random 3-CNF formulas cannot be certified by any property that is expressible in Datalog. Combined with the known relationship between the complexity of constraint satisfaction problems and expressibility in Datalog, our result implies that any constraint propagation algorithm working with small constraints will fail to certify unsatisfiability almost always. Our result is a consequence of designing a winning strategy for one of the players in the existential pebble game. The winning strategy makes use of certain extension axioms that we introduce and hold almost surely on a random 3-CNF formula. The second contribution of our work is the connection between finite model theory and propositional proof complexity. To make this connection explicit, we establish a tight relationship between the number of pebbles needed to win the game and the width of the Resolution refutations. As a consequence to our result and the known size--width relationship in Resolution, we obtain new proofs of the exponential lower bounds for Resolution refutations of random 3-CNF formulas and the Pigeonhole Principle.
An ordered probit analysis of factors promoting a regional information policy: the case of Japanese local governments
Authors: Masatsugu Tsuji, Jong-I1 Choe
Venue: Mathematics and Computers in Simulation (2004)

This paper empirically analyzes the factors which determine the success of regional information policies. Based upon our field research on 36 local governments in Japan, we examine how each factor contributes to successful implementation of regional information policy by using the ordered probit analysis. Generally speaking, it appears reasonable to assume that economic and financial factors are most important. However, the most important was found to be human factors such as the leadership taken by the heads of local governments. We comprehensively analyze why this is the case, contrary to what the theory suggests.