ppxscal/embedding_network huggingface dataset:
The logic of linear functors
Authors: R. Blute, J. R. B. Cockett, R. A. G. Seely
Venue: Mathematical Structures in Computer Science (2002)

This paper describes a family of logics whose categorical semantics is based on functors with structure rather than on categories with structure. This allows the consideration of logics that contain possibly distinct logical subsystems whose interactions are mediated by functorial mappings. For example, within one unified framework, we shall be able to handle logics as diverse as modal logic, ordinary linear logic, and the &lsquo;noncommutative logic&rsquo; of Abrusci and Ruet, a variant of linear logic that has both commutative and noncommutative connectives.Although this paper will not consider in depth the categorical basis of this approach to logic, preferring instead to emphasise the syntactic novelties that it generates in the logic, we shall focus on the particular case when the logics are based on a linear functor, in order to give a definite presentation of these ideas. However, it will be clear that this approach to logic has considerable generality.
How push-to-talk makes talk less pushy
Authors: Allison Woodruff, Paul M. Aoki
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

This paper presents an exploratory study of college-age students using two-way, push-to-talk cellular radios. We describe the observed and reported use of cellular radio by the participants. We discuss how the half-duplex, lightweight cellular radio communication was associated with reduced interactional commitment, which meant the cellular radios could be used for a wide range of conversation styles. One such style, intermittent conversation, is characterized by response delays. Intermittent conversation is surprising in an audio medium, since it is typically associated with textual media such as instant messaging. We present design implications of our findings.
Implementing privacy dimensions within an electronic storefront
Authors: Chang Liu, Jack Marchewka, Brian Mackie
Venue: Managing e-commerce and mobile computing technologies (2003)

Many electronic businesses will attempt to distinguish themselves from their competition and gain a competitive advantage by customizing their Web sites, in order to build a strong relationship with their customers. This will require the collection and use of personal information and data concerning the customer's online activities. Although new technologies provide an opportunity for enhanced collection, storage, use, and analysis of this data, concerns about privacy may create a barrier for many electronic businesses. For example, studies suggest that many people have yet to shop or provide personal information online due to a lack of trust. Moreover, many others tend to fabricate personal information. To this end, many electronic businesses have attempted to ease customers' concerns about privacy by posting privacy policies or statements, or by complying with a particular seal program. Recently, the Federal Trade Commission has proposed four privacy dimensions that promote fair information practices. These dimensions include: (1) notice/ awareness, (2) access/participation, (3) choice/consent, and (4) security/ integrity. An electronic storefront was developed to include these privacy dimensions as part of a study to learn how privacy influences trust and, in turn, how trust influences behavioral intentions to purchase online. The empirical evidence from this study strongly suggests that electronic businesses can benefit by including these privacy dimensions in their Web sites. This chapter will focus on how these dimensions can be implemented within an electronic storefront.
A Methodology for Hiding Knowledge in XML Document Collections
Authors: Tom Johnsten, Robert B. Sweeney, Vijay V. Raghavan
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Information marked up as XML data is becoming increasinglypervasive as a part of business-to-business electronictransactions. A possible threat to the continuedgrowth of XML in this domain is that data mining technologymay be applied to XML documents in order to revealsensitive knowledge. This paper presents a methodologyfor hiding sensitive knowledge in XML documents in thecontext of association mining algorithms. This methodologyinvolves identifying the sensitive knowledge within thedocument, formulating an appropriate set of security policies,and finally sanitizing the document to hide the sensitiveknowledge.
Disciplining information systems: truth and its regimes
Authors: Lucas D. Introna
Venue: European Journal of Information Systems (2003)

This paper provides a critical discussion of the ongoing concern of Information Systems (IS) academics on the status of IS as an academic discipline. The focal claim of the argument is that the status of IS as an 'academic discipline' is not an ontological or an epistemological question but rather a political one. In defending this claim the paper will draw on the work of Foucault, in particular his discussion on the relation between power and knowledge. The paper will conclude that the advice given by Paul (2002) and others may be appropriate but for very different reasons. It will claim that it is equally important, if not more so, to know the reasons why claims to legitimacy may Succeed or not, for such claims to be effective as a political programme.
Hybrid BIST Using an Incrementally Guided LFSR
Authors: C. V. Krishna, Nur A. Touba
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

A new hybrid BIST scheme is proposed which is based on using an "incrementally guided LFSR." It very efficiently combines external deterministic data from the tester with on-chip pseudo-random BIST. The hardware overhead is very small as a conventional STUMPS architecture [1] is used with only a small modification to the feedback of the LFSR which allows the tester to incrementally guide the LFSR so that it can embed patterns that detect therandom-pattern-resistant faults in the pseudo-random sequence. Compared with external testing, the proposed approach achieves dramatic reductions in tester storage requirementswhile using very simple on-chip hardware. Results indicate that the proposed approach provides very attractive tradeoffs between test length and tester storage requirements.
Transport properties of Mn-doped Ru2Si3
Authors: L. Ivanenko, A. Filonov, V. Shaposhnikov, G. Behr, D. Souptel, J. Schumann, H. Vinzelberg, A. Plotnikov, V. Borisenko
Venue: Microelectronic Engineering (2003)

Transport properties of Mn-doped ruthenium silicide Ru2Si3 were studied both experimentally and theoretically. The precipitation-free Ru2Si3 single crystals were grown by the zone melting technique with radiation heating. The temperature dependence of the electrical resistivity and Hall coefficients of the crystals were measured. The electrical resistivity of 1% Mn-doped Ru2Si3 was lower than that of undoped crystals. The carrier concentration in the doped samples is about 1018 cm-3 at room temperature. Mn-doped Ru2Si3 has a twice higher carrier mobility compared to the undoped one. Theoretical calculation of the charge carrier mobility is based on the effective masses which are estimated from the ab initio electronic band structure and classical scattering mechanisms.
The co-opticon: shared access to a robotic streaming video camera
Authors: Dezhen Song, Ken Goldberg
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

The "co-opticon" is a robotic pan, tilt, and zoom streaming video camera controlled by simultaneous frame requests from remote users. Robotic webcameras are commercially available but currently restrict control to only one user at a time. The co-opticon introduces a new interface that allows simultaneous control by many users. We will demonstrate the implemented system using a Java-based interface at the conference linked via the Internet to a camera on the UC Berkeley campus. We will also discuss system architecture and several new algorithms we've developed to compute optimal camera paramters based on user frame requests. The co-opticon can be tested online at: www.tele-actor.net/co-opticon.
Calculation of vibrational excitation of diatomic molecules below dissociative attachment threshold
Authors: P. Kolorenč, J. Horáček, K. Houfek, M. Č'Žek, G. Mil'nikov, H. Nakamura
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The problem of vibrational excitation (VE) of diatomic molecules by low-energy electrons below the threshold of dissociative attachment (DA) is a difficult and interesting problem. One of the interesting features is the unusual series of oscillations in VE cross section converging to the DA threshold, sometimes called the boomerang oscillations [1,2] see Figure 1. These oscillations are very sensitive to minor changes of underlying forces and represent a very stringent test of the theory used for the calculation of the VE cross section. The calculation of the VE cross section in this case is difficult because for energies below the DA threshold we have to solve scattering integral equations describing the motion of the nuclei in the resonance state at a negative energy. Scattering equations are always solved for positive energies since at these energies the particles may escape the scattering region completing the process of scattering. In such a case the leading term and the integral kernel are bounded functions provided the interaction potential is bounded. If the energy is negative the particles cannot escape. The leading term in scattering integral equation represents usually the free particle wave function which at negative energies diverges at large internuclear distances. We are therefore faced with the problem to solve integral equation with diverging leading term and diverging kernel. Since the underlying forces always decay at large distances we can restrict the integration to a finite range (0,R) where however R might be large for long range forces of polarization type. To our knowledge such problem has never been discussed in the literature. To tackle this problem we make use of the R-matrix representation of scattering Green's function recently proposed by the authors [3, 4] and perform detailed numerical study of convergence of the VE cross section in dependence of all parameters involved.
Towards a natural interface to adaptive service composition
Authors: Steffen Higel, Tony O'Donnell, Vincent Wade
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Novel modes of interaction and tailored application delivery are a key challenge in ubiquitous computing. This paper proposes a method of adaptively delivering lightweight, disposable service compositions to a user in a smart space. The user intuitively requests these services through a single, natural interface, which infers goals through observing behaviour and context. The composition is driven by generating tasks from these inferences, which can be resolved down to candidate services. We will discuss the proposed interaction between these components and highlight what direction our research will take.
Second king integral equations for the classical potential theory on open surfaces I: analytical apparatus
Authors: Shidong Jiang, Vladimir Rokhlin
Venue: Journal of Computational Physics (2003)

A stable second kind integral equation formulation has been developed for the Dirichlet problem for the Laplace equation in two dimensions, with the boundary conditions specified on a collection of open curves. The performance of the obtained apparatus is illustrated with several numerical examples.
Ontologies for corporate web applications
Authors: Leo Obrst, Howard H. Liu, Robert E. Wray
Venue: AI Magazine (2003)

In this article, we discuss some issues that arise when ontologies are used to support corporate application domains such as electronic commerce (e-commerce) and some technical problems in deploying ontologies for real-world use. In particular, we focus on issues of ontology integration and the related problem of semantic mapping, that is, the mapping of ontologies and taxonomies to reference ontologies to preserve semantics. Along the way, we discuss what typically constitutes an ontology architecture. We situate the discussion in the domain of business-to-business (B2B) e-commerce. By its very nature, B2B e-commerce must try to interlink buyers and sellers from multiple companies with disparate product-description terminologies and meanings, thus serving as a paradigmatic case for the use of ontologies to support corporate applications.
ILI-ideals and prime LI-ideals in lattice implication algebras
Authors: Yong Lin Liu, San Yang Liu, Yang Xu, Ke Yun Qin
Venue: Information Sciences: an International Journal (2003)

The notions of ILI-ideals and maximal LI-ideals of lattice implication algebras are introduced, respectively. The properties of ILI-ideals, prime LI-ideals and maximal LI- ideals are investigated. Several characterizations of ILI-ideals and prime LI-ideals are given. The extension theorem of ILI-ideals is obtained. The relations between ILI-ideals and LI-ideals, between ILI-ideals and implication filter, between prime LI-ideals and maximal LI-ideals, between prime LI-ideals and ILI-ideals, between maximal LI-ideals and ILI-ideals, between maximal LI-ideals and LI-ideals, and between prime LI-ideals and LI-ideals are investigated, respectively. Some classes of lattice implication algebras are characterized by their ILI-ideals (respectively prime LI-ideals, maximal LI-ideals).
A structural adviser for the XML document authoring
Authors: Boris Chidlovskii
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

Since the XML format became a de facto standard for structured documents, the IT research and industry have developed a number of XML editors to help users produce structured documents in XML format. However, the manual generation of structured documents in XML format remains a tedious and time-consuming process because of the excessive verbosity and length of XML code. In this paper, we design a structural adviser for the XML document authoring. The adviser intervenes at any step of the authoring process to suggest one tag or entire tree-like pattern the user is most likely to use next. Adviser suggestions are based on finding analogies between the currently edited fragment and sample data being either previously generated documents in the collection or the history of the current document authoring. The adviser is beneficial in cases when no schema is provided for XML documents, or schema associated with the document is too general and sample data contain specific patterns not captured in the schema. We design the adviser architecture and develop a method for efficient indexing and retrieval of optimal suggestions at any step of the document authoring.
A Lower Bound on the Greedy Weights of Product Codes
Authors: Hans Georg Schaathun
Venue: Designs, Codes and Cryptography (2004)

A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight er is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes.
On the use of color histograms for content based image retrieval in various color spaces
Authors: K. Konstantinidis, I. Andreadis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

As digital image libraries are already overpopulated, the development of improved methods for better indexing and retrieving images from such libraries (databases), has become an imperative issue. Content-based Image Retrieval (CBIR) is a technique for retrieving images on the basis of automatically-derived features such as color, texture and shape. The features used for retrieval can be either primitive or semantic, but the extraction process must be predominantly automatic [1]. A large number of applications, including military, industrial and civilian generate gigabytes of images daily. As a result, there is a huge amount of information which cannot be accessed or made use of unless it is organized [3]. By organized it is meant that appropriate indexing is available in order to allow efficient browsing, searching and retrieving as in keyword searches of text databases. The easiest way to search is with the use of query by example, which means that the user has to present an image to the system and the latter searches for others alike by extracting features from the example and comparing them to the ones stored in the database.
Routine run-time code generation
Authors: Sam Kamin
Venue: ACM SIGPLAN Notices (2003)

Run-time code generation (RTCG) would be used routinely if application programmers had a facility with which they could easily create their own run-time code generators, because it would offer benefits both in terms of the efficiency of the code that programmers would produce and the ease of producing it. Such a facility would necessarily have the following properties: it would not require that programmers know assembly language; programmers would have full control over the generated code; the code generator would operate entirely at the binary level. In this paper, we offer arguments and examples supporting these assertions. We briefly describe Jumbo, a system we have built for producing run-time code generators for Java..
Developing reactive systems in a VDM framework
Authors: Y. Ledru
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

The detailed validation of reactive systems, using an extension of VDM, is studied. The specification and proof of behavioural aspects is added to VDM by using traces of the inputloutput activities.The major objective of this work is to progress in the comprehension of the practical implications of the specification, design, and symbolic validation of machinechecked reactive systems.
A new distributed data mining model based on similarity
Authors: Tao Li, Shenghuo Zhu, Mitsunori Ogihara
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Distributed Data Mining (DDM) has been very active and enjoying a growing amount attention since its inception. Current DDM techniques regard the distributed data sets as a single virtual table and assume there exists a global model which could be generated if the data were combined/centralized. This paper proposes a similarity-based distributed data mining(SBDDM) framework which explicitly take the differences among distributed sources into consideration. A new similarity measure is introduced and its effectiveness is then evaluated and validated. This paper also illustrates the limitations of current DDM techniques through three concrete case studies. Finally distributed clustering within the SBDDM framework is also discussed.
A novel scheduling scheme to share dropping ratio while guaranteeing a delay bound in a multiCode-CDMA network
Authors: Peng-Yong Kong, Kee-Chaing Chua, Brahim Bensaou
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

A MultiCode-CDMA network that is capable of providing quality-of-service guarantees will find widespread application in future wireless multimedia networks. However, providing delay guarantees to time-sensitive traffic in such a network is challenging because its transmission capacity is variable even in the absence of any channel impairment. We propose and evaluate the performance of a novel transmission scheduling scheme that is capable of providing such a delay guarantee in a MultiCode-CDMA network. The proposed scheme drops packets to ensure that delays for all transmitted packets are within the guaranteed target bounds, but packets are dropped in a controlled manner such that the average dropping ratios of a set of time-sensitive flows can be proportionally differentiated according to the assigned weighting factors or shares. We provide extensive simulation results to show the effectiveness of the proposed scheme as well as to study the effects of various parameters on its performance. In particular, we show that it can simultaneously guarantee a delay upper bound and a proportionally differentiated dropping ratio in a fading wireless channel for different traffic loads, peak transmission rates, and weighting factors of individual flows.
Optical pattern recognition using a segmented semiconductor optical amplifier
Authors: Paul Vincent Petruzzi
Venue:  (2003)

In this thesis a technique for optical pattern recognition using a segmented semiconductor optical amplifier (SSOA) is presented. An SSOA is an optical amplifier that is fabricated from semiconductor gain material and has electrically isolated gold contacts along its length. As a result, each segment is driven by a separate current source producing a spatial gain-loss pattern along the length of the device. The cross-correlation of a binary optical pattern and the spatial gain-loss pattern is transcribed onto a probe beam by counter-propagating the optical pattern and the probe through the SSOA. Pattern recognition is performed by sampling the peak power of the cross-correlation, which is highest for the match pattern, and comparing the probe power to a threshold level. The transcription of the cross-correlation onto the probe is caused by the saturation of the gain and loss of the SSOA by the test pattern. Saturation occurs when the carrier population of the SSOA is changed by the test pattern, through absorption or stimulated emission, causing the gain or loss to change. When the test pattern is removed the carriers recover to their steady state population. The saturation and recovery dynamics of the SSOA are experimentally measured using a co-propagating pump-probe setup. These measurements are used in a rate equation model to simulate the output probe power from the SSOA. Cross-correlations of 4-bit patterns at 85 Gbit/s are experimentally demonstrated and show good agreement with simulated results. However, the signal-to-noise ratio of the cross-correlation signal is not large enough perform pattern recognition without errors. The model is used to simulate the operation of the SSOA in a Mach-Zehnder interferometer and demonstrate that this setup is capable of identifying four-bit patterns at a data rate of 180 Gbit/s. In addition, when a the probe signal is detected using a balanced receiver error-less pattern recognition can be performed with 8-bti patterns at 85 Gbit/s and four-bit patterns at 250 Gbit/s.