ppxscal/embedding_network huggingface dataset:
Intranets and local community: 'yes, an intranet is all very well, but do we still get free beer and a barbeque?'
Authors: Michael Arnold, Martin R. Gibbs, Philippa Wright
Venue: Communities and Technologies (2003)

This paper arises from a three year research project examining the development and implementation of a residential community intranet in Melbourne, Australia. At the time of writing, the level of use of the intranet by residents is low, and the paper explores possible reasons why this may be the case. These reasons include: a) the possibility that the aggregation of potential users and content is not appropriate; b) the possibility that the technology is not appropriate; c) the possibility that the conception of community relations on which the intranet is premised is not appropriate; d) the possibility that residents' perception of efforts to engineer community relations is not appropriate; and e) the possibility that the identity of the intranet as a domestic artefact has not yet been recognised by the residents. A consideration of these five possibilities using the specific case study raises issues concerning both particular community intranets, and more general socio-technical relations.
Using neural nets to optimize retrieval in a fuzzy relational database
Authors: George Baklarz
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

This paper examines the theory behind Fuzzy Sets and Back-Propagation Neural Nets, and how neural nets can be used to replace fuzzy sets and improve the query performance in a Fuzzy Relational Database (FRDB).Neural Nets and Fuzzy Relations are complementary theories that can be used together effectively in a Fuzzy Relational Database. This paper brings the theories of Fuzzy Sets, Neural Nets and Fuzzy Relational Databases together into one system.
Simple Matroids with Bounded Cocircuit Size
Authors: Joseph E. Bonin, Talmage James Reid
Venue: Combinatorics, Probability and Computing (2000)

We examine the specialization to simple matroids of certain problems in extremal matroid theory that are concerned with bounded cocircuit size. Assume that each cocircuit of a simple matroid M has at most d elements. We show that if M has rank 3, then M has at most d + &lfloor;&radic;d&rfloor; + 1 points, and we classify the rank-3 simple matroids M that have exactly d + &lfloor;&radic;d&rfloor; points. We show that if M is a connected matroid of rank 4 and d is q3 with q > 1, then M has at most q3 + q2 + q + 1 points; this upper bound is strict unless q is a prime power, in which case the only such matroid with exactly q3 + q2 + q + 1 points is the projective geometry PG(3, q). We also show that if d is q4 for a positive integer q and if M has rank 5 and is vertically 5-connected, then M has at most q4 + q3 + q2 + q + 1 points; this upper bound is strict unless q is a prime power, in which case PG(4, q) is the only such matroid that attains this bound.
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Authors: Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
Venue: Journal of the ACM (JACM) (2003)

In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61, with running times of O(m log m) and O(n3), respectively, where n is the total number of vertices and m is the number of edges in the underlying complete bipartite graph between cities and facilities. The algorithms are used to improve recent results for several variants of the problem.
A fast and effective steganalytic technique against JSteg-like algorithms
Authors: Tao Zhang, Xijian Ping
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Detection of hidden messages in images, also known as image steganalysis, is of great significance to network information security. In this paper, we propose a fast and effective steganalytic technique based on statistical distributions of DCT coefficients which is aimed at two kinds of popular JSteg-like steganographic systems, sequential JSteg and random JSteg for JPEG images. Our approach can not only determine the existence of hidden messages in JPEG images reliably, but also estimate the amount of hidden messages exactly. Its advantages also include simplicity, computational efficiency and easy implementation of real-time detection. Experiment results show the superiority of our approach over other steganalytic techniques.
Improved step and flash imprint lithography templates for nanofabrication
Authors: D. J. Resnick, D. Mancini, W. J. Dauksher, K. Nordquist, T. C. Bailey, S. Johnson, S. V. Sreenivasan, J. G. Ekerdt, C. G. Willson
Venue: Microelectronic Engineering (2003)

Step and flash imprint lithography (SFIL) is an attractive method for printing sub-100 nm geometries. Relative to other imprinting processes, SFIL has the advantage that the template is transparent, thereby facilitating conventional overlay techniques. In addition, the imprint process is performed at low pressures and room temperature, which minimizes magnification and distortion errors. Several different methods for fabricating templates are presented in this study. One scheme addresses some of the weaknesses associated with a solid glass substrate by incorporating a conductive and transparent layer of indium tin oxide (ITO) on the surface of the substrate. Features are defined on the templates by patterning a thin layer of PECVD oxide that is deposited on the ITO layer. A second method bypasses the oxide etch process by imaging a thin layer of hydrogen silsesquioxane (HSQ). By using a combination of these two methods, it is also possible to form multi-tiered structures on a template. Templates with features as small as 20 nm have been fabricated using the methods described above. The templates were then used to imprint patterns on 200 mm silicon wafers. It appears that any feature defined in the template is faithfully replicated on the wafer.
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
Authors: R. M. Kolpakov
Venue: Discrete Applied Mathematics (2004)

The problem of generating the set of all n-ary rational probabilities by arbitrary finite subsets of Boolean functions for each n ≥ 2 is considered. A criterion for the possibility of such a generation is obtained in the class of all Boolean functions.
Augmented reality disk jockey: AR/DJ
Authors: Philipp Stampfl
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This technical sketch describes an application for 3D sound using intuitive augmented reality interface. The AR/DJ was designed for the use in todays clubs, allowing a DJ to use the capabilities of 3D sound in such an environment, with the demands of being easy to use, enabling collaborative use and generating accurate and inter- active 3D sound.
Using Association Rules to Discover Search Engines Related Queries
Authors: Bruno M. Fonseca, Paulo B. Golgher, Edleno S. de Moura, Nivio Ziviani
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

This work presents a method for automatic generate suggestions of related queries submitted toWeb search engines. The method extracts information from the log of past submitted queries to search engines using algorithms for mining association rules. Experimental results were performed on a log containing more than 2.3 million queries submitted to a commercial searching engine giving correct suggestions in 90.5% of the top 5 suggestions presented for common queries extracted from a real log.
Understanding Helicoverpa armigera Pest Population Dynamics related to Chickpea Crop Using Neural Networks
Authors: Rajat Gupta, B. V. L. Narayana, P. Krishna Reddy, G. V. Ranga Rao, C. L. L. Gowda, Y. V. R. Reddy, G. Rama Murthy
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Insect pests are a major cause of crop loss globally. Pestmanagement will be effective and efficient if we canpredict the occurrence of peak activities of a given pest.Research efforts are going on to understand the pestdynamics by applying analytical and other techniques onpest surveillance data sets. In this study we make an effortto understand pest population dynamics using NeuralNetworks by analyzing pest surveillance data set ofHelicoverpa armigera or Pod borer on chickpea (Cicerarietinum L.) crop. The results show that neural networkmethod successfully predicts the pest attack incidences forone week in advance.
A Two-Phase BMAP|G|1|N &rarr; PH|1|M &ndash; 1 System with Blocking
Authors: D. Breuer, A. N. Dudin, V. I. Klimenok, G. V. Tsarenkov
Venue: Automation and Remote Control (2004)

The stationary probability distribution of a two-phase queueing system with a finite or an infinite buffer for the first phase and a finite buffer for the second phase is derived. The input flow of the system is a batch Markov arrival process. Both phases have single-servers. The service time distribution is arbitrary for the first phase and of phase-type for the second phase. If the buffer of the second phase is full at the instant of completion of service at the first phase, the first server is blocked until the buffer is freed.
A Markov Random Field model of microarray gridding
Authors: Mathias Katzer, Franz Kummert, Gerhard Sagerer
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

DNA microarray hybridisation is a popular high through-put technique in academic as well as industrial functional genomics research. In this paper we present a new approach to automatic grid segmentation of the raw fluorescence microarray images by Markov Random Field (MRF) techniques. The main objectives are applicability to various types of array designs and robustness to the typical problems encountered in microarray images, which are contaminations and weak signal.We briefly introduce microarray technology and give some background on MRFs. Our MRF model of microarray gridding is designed to integrate different application specific constraints and heuristic criteria into a robust and flexible segmentation algorithm. We show how to compute the model components efficiently and state our deterministic MRF energy minimization algorithm that was derived from the 'Highest Confidence First' algorithm by Chou et al. Since MRF segmentation may fail due to the properties of the data and the minimization algorithm, we use supplied or estimated print layouts to validate results.Finally we present results of tests on several series of microarray images from different sources, some of them test sets published with other microarray gridding software. Our MRF grid segmentation requires weaker assumptions about the array printing process than previously published methods and produces excellent results on many real datasets.An implementation of the described methods is available upon request from the authors.
Markowitz's Mean-Variance Portfolio Selection with Regime Switching: A Continuous-Time Model
Authors: Xun Yu Zhou, G. Yin
Venue: SIAM Journal on Control and Optimization (2003)

A continuous-time version of the Markowitz mean-variance portfolio selection model is proposed and analyzed for a market consisting of one bank account and multiple stocks. The market parameters, including the bank interest rate and the appreciation and volatility rates of the stocks, depend on the market mode that switches among a finite number of states. The random regime switching is assumed to be independent of the underlying Brownian motion. This essentially renders the underlying market incomplete. A Markov chain modulated diffusion formulation is employed to model the problem. Using techniques of stochastic linear-quadratic control, mean-variance efficient portfolios and efficient frontiers are derived explicitly in closed forms, based on solutions of two systems of linear ordinary differential equations. Related issues such as a minimum-variance portfolio and a mutual fund theorem are also addressed. All the results are markedly different from those for the case when there is no regime switching. An interesting observation is, however, that if the interest rate is deterministic, then the results exhibit (rather unexpected) similarity to their no-regime-switching counterparts, even if the stock appreciation and volatility rates are Markov-modulated.
Implicit Random Constraint Satisfaction Problems
Authors: Christophe Lecoutre, Frédéric Boussemart, Fred Hemery
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Random CSPs (Constraint Satisfaction Problems) provide interesting benchmarks for experimental evaluation of algorithms. From a theoretical point of view, a lot of recent works have contributed to guarantee the existence of a so-called phase transition and, consequently, of hard and large problem instances. From a practical point of view, due to exponential space complexity, a vast majority of experiments based on random CSPs concerns binary problems. In this paper, we introduce a model of implicit random CSPs, i.e., of random CSPs where constraints are not given in extension but defined by a predicate. This new model involves an easy implementation, no space requirement and the possibility to perform experiments with large arity constraints.
Abstract Congruence Closure
Authors: Leo Bachmair, Ashish Tiwari, Laurent Vigneron
Venue: Journal of Automated Reasoning (2003)

We describe the concept of an abstract congruence closure and provide equational inference rules for its construction. The length of any maximal derivation using these inference rules for constructing an abstract congruence closure is at most quadratic in the input size. The framework is used to describe the logical aspects of some well-known algorithms for congruence closure. It is also used to obtain an efficient implementation of congruence closure. We present experimental results that illustrate the relative differences in performance of the different algorithms. The notion is extended to handle associative and commutative function symbols, thus providing the concept of an associative-commutative congruence closure. Congruence closure (modulo associativity and commutativity) can be used to construct ground convergent rewrite systems corresponding to a set of ground equations (containing AC symbols).
Comparative Analysis of Quality of Service Routing in Wireless Metropolitan Area Networks
Authors: Matthias Hollick, Tronje Krop, Jens Schmitt, Hans-Peter Huth, Ralf Steinmetz
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Currently, we see the evolution of large scale communityand metropolitan area networks based on inexpensivewireless local area network technology. We presentthe results of an experimental analysis which investigatesthe potential of quality of service routing mechanismswithin this challenging environment. Ourinvestigation is based on a model of a radio access networkdesigned to cover a large city center by means ofdecentralized and distributed routers, which are tightlymeshed. The workload is modeled to reflect the estimatedusage patterns based on statistical data collection of usermobility and combined with synthetic traffic matrices.We present results for various routing strategies includingshortest path routing, delay constrained routing aswell as various multipath quality of service routing variants.Moreover, we investigate different traffic distributions.Our findings are, that multipath routing is able toenhance the utility of the network significantly.
Automated reconstruction of building facades for virtual walk-thrus
Authors: Christian Frueh, Avideh Zakhor
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

In this paper, we present a fast, automated approach to generating a highly detailed, textured 3D building facade model. This model is acquired at the ground level by driving a vehicle equipped with laser scanners and a digital camera under normal traffic conditions on public roads, and then processed offline. We evaluate our approach on a large data set acquired in downtown Berkeley.
A treecode algorithm for computing Ewald summation of dipolar systems
Authors: Zhong-Hui Duan, Robert Krasny
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We present a treecode algorithm for efficiently computing the real space part of Ewald summation in periodic dipolar systems. The algorithm uses multipole expansion in Cartesian coordinates to approximate the real space interaction between a dipole and a distant cluster of dipoles. The necessary Taylor coefficients are computed efficiently using recurrence relations. Two divide-and-conquer evaluation procedures are described. Test results are presented for systems of randomly generated dipoles.
Some connections between bounded query classes and non-uniform complexity
Authors: Amihood Amir, Richard Beigel, William Gasarch
Venue: Information and Computation (2003)

Let A(x) be the characteristic function of A. Consider the function CkA(x1,...,xk) = A(x1)...A(xk). We show that if CkA can be computed in polynomial time with fewer than k queries to some set X then A ∈ P/poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming Σ3p ≠ Φ3p, there are functions computable using f(n) + 1 queries to SAT that are not computable using f(n) queries to SAT, for f(n) = O(log n). (2) If CkA, restricted to length n inputs, can be computed by an unbounded fanin oracle circuit of size s(n) and depth d(n), with k - 1 queries to some set X, then A can be computed with an unbounded fanin (non-oracle) circuit of size nO(k) s(n) and depth d(n) + O(1). (3) Assuming that PH ≠ Σ4p ∩ Φ4p, and ε > 1, #SAT is not 2nε-enumerable.
Applying genetic algorithms in database partitioning
Authors: Vincent Ng, Dik Man Law, Narasimhaiah Gorla, Chi Kong Chan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

One popular technique used to enhance database performace is attribute partitioning. Attribute partitioning is the process of subdividing the attributes of a relation and then grouping them into fragments so as to minimize the number of disk access by all transactions. On the other hand, tuple clustering, which is the process of rearranging the order of tuples so that frequently queried tuples are grouped into as few blocks as possible, is mostly ignored. In this paper, we address the need of considering the n-ary attribute partitioning and tuple clustering at the same time in a relational database. A new algorithm is proposed for mixed fragmentation design using genetic algorithm. Java programs have been developed to implement the genetic algorithm for mixed fragmentation and the results are promising. It provides an improvement over previous works which considered vertical partitioning and tuple clustering separately. Comparisons with exhaustive enumeration and random search are also presented.
Compressed Index for Dynamic Text
Authors: Wing-Kai Hon, Tak-Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu
Venue: Proceedings of the Conference on Data Compression (2004)

This paper investigates how to index a text which is subject to updates. Thebest solution in the literature is based on suffix tree using O(n log n) bits ofstorage, where n is the length of the text. It supports finding all occurrences ofa pattern P in O(|P| + occ) time, where occ is the number of occurrences.Eachtext update consists of inserting or deleting a substring of length y and can besupported in O(y + \sqrt n) time. In this paper, we initiate the study of compressedindex using only O(n log |\Sigma|) bits of space, where \Sigma denotes the alphabet. Oursolution supports finding all occurrences of a pattern P in O(|P| log2 n(log\epsilon n + log |\Sigma|) + occlog1+\epsilon n) time, while insertion or deletion of a substring of length y can be done inO((y + \sqrt n) log2+\epsilon n) amortized time, where0 \lt \epsilon \le 1.The corepart of our data structure is based on the recent work on Compressed Suffix Trees(CST) and Compressed Suffix Arrays (CSA).
Nigerian Case Study: Lessons Learned in Piloting the National Health Management Information System in Bauchi, Enugu, and Oyo States
Authors: Toyin Akpan, Hannah Searing, Ade Adetunji
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

The Vision Project (VISION) and the Federal Ministry of Health of Nigeria (FMOH) are collaboratively implementing a three-year (2001-2004) family planning and reproductive health (FP/RH) project in three states and 15 Local Government Areas (LGAs) in Nigeria, with funding and support from the United States Agency for International Development (USAID). During the proposal design process, the FMOH underscored a vital need for routine data to plan health programs. To meet this need, as part of the program, VISION agreed to pilot test the FMOH's National Health Information System (NHMIS), which the FMOH designed in the late 1990s but never fully implemented. The purpose of the pilot is to support the institutionalization of a sustainable, federally endorsed system that provides routine health data to Nigerians to help them to plan and manage their health programs. This paper describes how Nigerians are working towards this goal, discusses major challenges they have encountered, solutions they have implemented, and provides recommendations for other countries that wish to learn from their experience.
Choosing when to interact with learners
Authors: Lei Qu, Ning Wang, W. Lewis Johnson
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

In this paper, we describe a method for pedagogical agents to choose when to interact with learners in interactive learning environments. This method is based on observations of human tutors coaching students in on-line learning tasks. It takes into account the focus of attention of the learner, the learner's current task, and expected time required to perform the task. A Bayesian network model combines evidence from eye gaze and interface actions to infer learner focus of attention. The attention model is combined with a plan recognizer to detect different types of learner difficulties such as confusion and indecision which warrant intervention. We plan to incorporate this capability into a pedagogical agent able to interact with learners in socially appropriate ways.
Logical relation for encryption
Authors: Eijiro Sumii, Benjamin C. Pierce
Venue: Journal of Computer Security (2003)

The theory of relational parametricity and its logical relations proof technique are powerful tools for reasoning about information hiding in the polymorphic λ-calculus. We investigate the application of these tools in the security domain by defining a cryptographic λ-calculus - an extension of the standard simply typed λ-calculus with primitives for encryption, decryption, and key generation - and introducing syntactic logical relations (in the style of Pitts and Birkedal-Harper) for this calculus that can be used to prove behavioral equivalences between programs that use encryption.We illustrate the framework by encoding some simple security protocols, including the Needham-Schroeder public-key protocol. We give a natural account of the well-known attack on the original protocol and a straightforward proof that the improved variant of the protocol is secure.
Disk Scheduling onMultimedia Storage Servers
Authors: Yin-Fu Huang, Jiing-Maw Huang
Venue: IEEE Transactions on Computers (2004)

Abstract--In this paper, a disk scheduler called MS-EDF is proposed not only to meet the deadlines of all requests, but also to offer the optimal seek time. Through the experiments, the results show our disk scheduling algorithm outperforms the others for multimedia systems in all cases.