ppxscal/embedding_network huggingface dataset:
O.Arpacioglu, Z. J. Haas, &lsquo;On the scalabilty and capacity of planar wireless networks with omnidirectional antennas&rsquo;. Wireless Communications and Mobile Computing 20044(3): 263&ndash;279: Erratum
Authors: Staff
Venue: Wireless Communications Mobile Computing (2004)

The original article to which this Erratum refers was published in Wireless Communications and Mobile Computing 2004; 4(3): 263&ndash;279. 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
Vectorial Approach to Fast Correlation Attacks
Authors: Jovan D. J. Golić, Philip Hawkes
Venue: Designs, Codes and Cryptography (2005)

A new, vectorial approach to fast correlation attacks on binary memoryless combiners is proposed. Instead of individual input sequences or their linear combinations, the new attack is targeting subsets of input sequences as a whole thus exploiting the full correlation between the chosen subset and the output sequence. In particular, the set of all the input sequences can be chosen as the target. The attack is based on a novel iterative probabilistic algorithm which is also applicable to general memoryless combiners over finite fields or finite rings. To illustrate the effectiveness of the introduced approach, experimental results obtained for random balanced combining functions are presented
Estimation of Higher Sobolev Norm from Lower Order Approximation
Authors: Carsten Carstensen
Venue: SIAM Journal on Numerical Analysis (2004)

Given an accurate piecewise constant flux approximation $q$ of a smooth (but unknown) exact flux $p$, how can one compute a Sobolev norm of $p$ over a small domain $\omega$? This question arises in a duality argument of goal-oriented finite element a posteriori error analysis. Two equivalent practical estimators $\eta_{M}$ and $\eta_{\mathcal{E}}$ are presented for an approximation $\!q\!$ of $|p|_{H^1(\omega)}$ and model situations are addressed where $\!q\!$ is asymptotically an upper and +lower bound of $|p|_{H^1(\Omega)}$.
Note on the startup of ODE solvers
Authors: A. C. Hindmarsh
Venue: ACM SIGNUM Newsletter (1976)

In a recent note in this Newsletter [1], Warner concludes that stiff ODE solvers may need to start up with a high-order method because a first-order startup can lead to certain incompatible requirements if the problem is sufficiently stiff. This note attempts to show why that conclusion is unwarranted.
An architecture a day keeps the hacker away
Authors: David A. Holland, Ada T. Lim, Margo I. Seltzer
Venue: ACM SIGARCH Computer Architecture News (2005)

System security as it is practiced today is a losing battle. In this paper, we outline a possible comprehensive solution for binary-based attacks, using virtual machines, machine descriptions, and randomization to achieve broad heterogeneity at the machine level. This heterogeneity increases the "cost" of broad-based binary attacks to a sufficiently high level that they cease to become feasible. The convergence of several recent technologies appears to make our approach achievable at a reasonable cost, with only moderate run-time overhead.
Red Hat® Enterprise Linux Fedora™ Core 4: The Complete Reference, 3 edition
Authors: Richard Petersen
Venue:  (2005)

The new edition of this best-selling reference offers complete coverage of all aspects of the Red Hat Fedora and Enterprise Linux distribution. Full details on everything from installation and configuration to system administration and server management of Enterprise Linux--with specifics on the Linux Kernel 2.6--are included. The new IPv6 Protocol, including the network security features of IPSEC and Virtual Private Networks, are also covered. The DVD contains the entire Red Hat Fedora Core distribution--normally available on multiple CD-ROMs.
Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1.
Authors: Keith Price
Venue: Issue 71 (April 1980) (1980)

Nils Nilsson's new book on AI is now available from Tioga Publishing Company, P.O. Box 98, Palo Alto, CA 94302; (415) 854--2445. 476 + xv pages including approx. 400 references, remarks about the references, and exercises. 1980, ISBN 0-935382-01-1; $24.50 plus shipping and handling.
A model for deliberation, action, and introspection
Authors: Jon Doyle
Venue: Issue 75 (January 1981) (1981)

This thesis investigates the problem of controlling or directing the reasoning and actions of a computer program. The basic approach explored is to view reasoning as a species of action, so that a program might apply its reasoning powers to the task of deciding what inferences to make as well as to deciding what other actions to take. A design for the architecture of reasoning programs is proposed. This architecture involves self-consciousness, intentional actions, deliberate adaptations, and a form of decision-making based on dialectical argumentation. A program based on this architecture inspects itself, describes aspects of itself to itself, and uses this self-reference and these self-descriptions in making decisions and taking actions. The program's mental life includes awareness of its own concepts, beliefs, desires, intentions, inferences, actions, and skills. All of these are represented by self-descriptions in a single sort of language, so that the program has access to all of these aspects of itself, and can reason about them in the same terms.
A personalized search engine based on web-snippet hierarchical clustering
Authors: Paolo Ferragina, Antonio Gulli
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper we propose a hierarchical clustering engine, called snaket, that is able to organize on-the-fly the search results drawn from 16 commodity search engines into a hierarchy of labeled folders. The hierarchy offers a complementary view to the flat-ranked list of results returned by current search engines. Users can navigate through the hierarchy driven by their search needs. This is especially useful for informative, polysemous and poor queries.SnakeT is the first complete and open-source system in the literature that offers both hierarchical clustering and folder labeling with variable-length sentences. We extensively test SnakeT against all available web-snippet clustering engines, and show that it achieves efficiency and efficacy performance close to the best known engine Vivisimo.com.Recently, personalized search engines have been introduced with the aim of improving search results by focusing on the users, rather than on their submitted queries. We show how to plug SnakeT on top of any (un-personalized) search engine in order to obtain a form of personalization that is fully adaptive, privacy preserving, scalable, and non intrusive for underlying search engines.
The unless switch: adding conditional logic to concept mapping for middle school students
Authors: Kevin Hartman, Kristen Pilner Blair
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Qualitative concept maps are useful for sharing the structure of a domain and for assessing students' understanding. While concept maps made from links and nodes depict static causal relationships between concepts quite well, they provide little support for displaying conditional logic and thresholds for causation. In this paper, we describe the process of incorporating a representation for conditional reasoning into Betty, a computer agent students teach via concept maps. Betty helps students formalize their knowledge of a domain by acting as a novice learner. Students use Betty to construct and assess their knowledge of science topics.We tested several prototypes combining conditional logic with concept maps and found that people had difficulty keeping conditional states and conceptual nodes separate. In the end, the "Unless Switch" provided the closest semantic parallel to the type of reasoning we wanted students to learn and generated the least amount of confusion.
Performance benefits through integration hubs
Authors: Ellen Christiaanse
Venue: Communications of the ACM (2005)

Some recent integration hubs provide configurations that facilitate optimization beyond the buyer-supplier dyad provided by traditional point-to-point integration. We argue that coordination so far has been preliminary dyadic but that a new era of network-level optimization is possible, providing future benefits beyond dyadic coordination and optimization mechanisms through the use of integration hubs and B2B marketplaces.
The inteligent system
Authors: W. Fritz
Venue: Issue 90 (October 1984) (1984)

In this article, the brain is observed as a total system. A hypotesis of the various functions of the brain is set up and then partially tested through the workings of a computer program.
KPT: a dynamic KNN query processing algorithm for location-aware sensor networks
Authors: Julian Winter, Wang-Chien Lee
Venue: Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 (2004)

An important type of spatial queries for sensor networks are K Nearest Neighbor (KNN) queries. Currently, research proposals for KNN query processing is based on index structures, which are typically expensive in terms of energy consumption. In addition, they are vulnerable to node failure and are difficult to maintain in dynamic sensor networks. In this paper, we propose KPT, an algorithm for dynamically processing KNN queries in location-aware sensor networks. KPT shows great potential for energy savings and improved query latency. Since the tree infrastructure is constructed only temporarily, KPT is less vulnerable to sensor node failure.
Fuzzy-based Parameterized Gaussian Edge Detector Using Global and Local Properties
Authors: John See, Madasu Hanmandlu, Shantaram Vasikarla
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Many edge detection schemes suffer from the lack of image quality at the global level. Global properties are more vital in grayscale images due to loss of hue and texture. This paper proposes a novel fuzzy-based Gaussian edge detector that uses both global and local image properties for grayscale images. In the global contrast intensification phase, each pixel in an image is represented in the fuzzy domain using a modified Gaussian membership function. A nonlinear contrast intensification function containing three parameters is used to further enhance the image. In the local phase, we present a novel fuzzy parameterized Gaussian-type edge detector mask containing two fuzzifier parameters, which are chosen based on experimental selection rules. Optionally, the fuzzy image entropy function can be used to optimize all the parameters through simple gradient descent technique. In experiments conducted on various classic images, this algorithm showed notable visual improvement on both strong and weak edges in comparison with common edge detectors.
A Low-Power and Domain-Specific Reconfigurable FFT Fabric for System-on-Chip Applications
Authors: Yutian Zhao, Ahmet T. Erdogan, Tughrul Arslan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

A low-power dynamic reconfigurable FFT fabric is proposed in this paper. The architecture is served as a scalable IP Core which is suitable for System on Chip applications. The system can be configured as 16, 32, 64, 128, 256, 512 and 1024-point FFT. Compared with a conventional ASIC FFT processor, this FFT fabric is characterized by having dynamic reconfigurability while incurring only a 12~19% increase in energy consumption, and requiring 14% more area than a 1024-point non-reconfigurale FFT fabric. On the other hand, compared with a FFT processor which is mapped onto a general purpose reconfigurable architecture, it has 30~94% less energy consumption.
Measuring the effective parameters of steering motions
Authors: Sergey Kulikov, I. Scott MacKenzie, Wolfgang Stuerzlinger
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The steering law model describes pointing device motion through constrained paths. Previous uses of the model are deficient because they are built using only error-free responses, ignoring altogether the path of the cursor. We correct this by proposing and validating a technique to include spatial variability, including errors. The technique is a variant of the well-known "effective target width" used in Fitts' law models. An experiment designed to test our technique demonstrates the improvement: Correlations are consistently higher when spatial variability is included in building the model. Suggestions to aid further development of the steering law model are included.
A simple real time executive tinyexec as a teaching tool in an operating system class
Authors: Vir V. Phoha
Venue: Journal of Computing Sciences in Colleges (2005)

This paper presents our experience of using a small real time executive tinyexec as a teaching tool in an operating system class. We present the details of the tinyexec that include a state transition diagram, pseudocode, and some sample exercises that can enhance students understanding of operating systems concepts. tinyexec has 300 lines of code and works in a stand-alone or a DOS or WINDOWS environment. It can be easily modified and ported. Our experience shows that the small size of tinyexec is an advantage over many other systems like LINUX-RT and can result in extensive experimentation and it is an excellent source to supplement the operating systems concepts with a real executive.
Improving Prolog programs
Authors: Paul Creelman
Venue: Issue 89 (July 1984) (1984)

Optimizing logic programs written in Prolog is an easy task. The depth first search ensures that rules Ri in the axiom list (global database) are searched from top to bottom of the global axiom list. (For simple implementations such as Robert Wallace's PiL published in the July 1983 issue of the SIGART Newsletter.) 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
Fast approximate PCPs for multidimensional bin-packing problems
Authors: Tuǧkan Batu, Ronitt Rubinfeld, Patrick White
Venue: Information and Computation (2005)

We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blocks can be packed into a small number of bins. The running time of the verifier is bounded by O(logd n) where n is the number of blocks and d is the dimension.
Book review: Intelligent Systems in Business: Integrating the Technology Edited by J. Jeffrey Richardson and Marjorie J. DeFries (Ablex, Norwood, N J, 1990)
Venue: ACM SIGART Bulletin (1991)

This book is a collection of 22 papers and represents the proceedings of a forum on "Increasing Management Productivity with Intelligent Systems" held in Snowmass/Aspen, Colorado, in August 1988. The proceedings are aimed at the managerial reader, and the content is intended to be relatively nontechnical. The purpose of these proceedings is "to help managers learn, not about techniques, but about applications of intelligent systems to the business problems of today" and to provide nontechnical "advice from others with some experience using these new systems." As in any collection of papers, individual contributors have followed the stated objectives to a greater or lesser degree.
Unification Modulo ACUI Plus Distributivity Axioms
Authors: Siva Anantharaman, Paliath Narendran, Michael Rusinowitch
Venue: Journal of Automated Reasoning (2004)

E-unification problems are central in automated deduction. In this work, we consider unification modulo theories that extend the well-known ACI or ACUI by adding a binary symbol "*" that distributes over the AC(U)I-symbol "+." If this distributivity is one-sided (say, to the left), we get the theory denoted AC(U)IDl; we show that AC(U)IDl-unification is DEXPTIME-complete. If "*" is assumed two-sided distributive over "+," we get the theory denoted AC(U)ID; we show unification modulo AC(U)ID to be NEXPTIME-decidable and DEXPTIME-hard. Both AC(U)IDl and AC(U)ID seem to be of practical interest, for example, in the analysis of programs modeled in terms of process algebras. Our results, for the two theories considered, are obtained through two entirely different lines of reasoning. A consequence of our methods of proof is that, modulo the theory that adds to AC(U)ID the assumption that "*" is associative-commutative, or just associative, unification is undecidable.
A Wavelet Based Algorithm for Multi-Focus Micro-Image Fusion
Authors: Zhi-guo Jiang, Dong-bing Han, Jin Chen, Xiao-kuan Zhou
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, extending depth of focus from microscopy images is investigated by using multi-focus image fusion techniques. The principle of image fusion based on depth of focus is analyzed, and comparisons of different spatial domain fusion methods are given. Furthermore, a multi-focus micro-image fusion algorithm based on area wavelet transform, which offers improved performance over existing algorithms, is studied and presented. The performance of the spatial domain and wavelet-based algorithms is compared. Advantages and disadvantages of this algorithm are analyzed by experiments, and the main features of this algorithm are summarized and applicable areas are suggested.
Anticipation-based partial redundancy elimination for static single assignment form
Authors: Thomas VanDrunen, Antony L. Hosking
Venue: Software&mdash;Practice Experience (2004)

Partial redundancy elimination &lpar;PRE&rpar; is a program transformation that identifies and eliminates expressions that are redundant on at least one &lpar;but not necessarily all&rpar; execution paths of a program without increasing any path length. Chow, Kennedy and co-workers devised an algorithm &lpar;SSAPRE&rpar; for performing partial redundancy elimination on intermediate representations in static single assignment &lpar;SSA&rpar; form. The practicality of that algorithm is limited by the following concerns: &lpar;1&rpar; it makes assumptions about the namespace that are stronger than those of SSA form and that may not be valid if other optimizations have already been performed on the program; &lpar;2&rpar; if redundancies occur in nested expressions, the algorithm may expose but not eliminate them &lpar;requiring a second pass of the algorithm&rpar;; &lpar;3&rpar; it misses cases covered by the state of the art in PRE; and &lpar;4&rpar; it is difficult to understand and implement. We present an algorithm &lpar;A-SSAPRE&rpar; structurally similar to SSAPRE that uses anticipation rather than availability; this algorithm is simpler than SSAPRE, covers more cases, eliminates nested redundancies on a single pass, and makes no assumptions about the namespace. Copyright &copy; 2004 John Wiley & Sons, Ltd.
SemRank: ranking complex relationship search results on the semantic web
Authors: Kemafor Anyanwu, Angela Maduko, Amit Sheth
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently gained some ground, the issue of how search results will be ranked remains largely unaddressed. Since it is expected that the number of relationships between entities in a knowledge base will be much larger than the number of entities themselves, the likelihood that Semantic Association searches would result in an overwhelming number of results for users is increased, therefore elevating the need for appropriate ranking schemes. Furthermore, it is unlikely that ranking schemes for ranking entities (documents, resources, etc.) may be applied to complex structures such as Semantic Associations.In this paper, we present an approach that ranks results based on how predictable a result might be for users. It is based on a relevance model SemRank, which is a rich blend of semantic and information-theoretic techniques with heuristics that supports the novel idea of modulative searches, where users may vary their search modes to effect changes in the ordering of results depending on their need. We also present the infrastructure used in the SSARK system to support the computation of SemRank values for resulting Semantic Associations and their ordering.
Trend detection through temporal link analysis
Authors: Einat Amitay, David Carmel, Michael Herscovici, Ronny Lempel, Aya Soffer
Venue: Journal of the American Society for Information Science and Technology (2004)

Although time has been recognized as an important dimension in the co-citation literature, to date it has not been incorporated into the analogous process of link analysis on the Web. In this paper, we discuss several aspects and uses of the time dimension in the context of Web information retrieval. We describe the ideal case-- where search engines track and store temporal data for each of the pages in their repository, assigning timestamps to the hyperlinks embedded within the pages. We introduce several applications which benefit from the availability of such timestamps. To demonstrate our claims, we use a somewhat simplistic approach, which dates links by approximating the age of the page's content. We show that by using this crude measure alone it is possible to detect and expose significant events and trends. We predict that by using more robust methods for tracking modifications in the content of pages, search engines will be able to provide results that are more timely and better reflect current real-life trends than those they provide today.
How to minimize the TCP effect in a UMTS-HSDPA system&quest;: Research Articles
Authors: Mohamad Assaad, Djamal Zeghlache
Venue: Wireless Communications Mobile Computing (2005)

This paper focuses on the interaction between the transmission control protocol (TCP) layer and the radio interface in a 3G wireless system. An analytical model to evaluate the impact of TCP on the UMTS-HSDPA capacity is presented. A method to minimize the effect of TCP on wireless networks using shared channels is also proposed. High speed downlink packet access (HSDPA) is an evolution of the UMTS standard over the air interface to achieve higher aggregate bit rates through the introduction of adaptive modulation and coding, hybrid automatic repeat request (ARQ), fast scheduling, fast cell selection, and multiple input multiple output (MIMO) (space time coding and blast) techniques. The proposed model is used to evaluate the effect of the TCP protocol on the bit rate of various data services (at 64 and 128&thinsp;kbps). As expected, the bit rate per flow decreases strongly if the congestion frequency in the wired network increases. However, the overall capacity achieved by HSDPA is not as affected by the TCP layer. Using this result, a method to maintain the bit rate per TCP flow at a given value without loosing much cell capacity is proposed. The findings are supported by simulation results. Copyright &copy; 2005 John Wiley & Sons, Ltd.