ppxscal/embedding_network huggingface dataset:
Spaces: Support for Decoupled Communication in Wide-Area Parallel Applications
Authors: Philip Chan, David Abramson
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Wide-area distributed systems like computational grids are emergent infrastructures for high-performance parallel applications. On these systems, communication mechanisms have to deal with many issues, including: private networks, heterogeneity, dynamic resource availability, and transient link failures. To address this, we present -Spaces, a shared space abstraction of typed pipe objects. These objects, called -channels, are asynchronous pipes that combine streaming and persistence for efficient communication while supporting spatial and temporal decoupling. This feature allows -channels to be written even in the absence (or failure) of the reader. In this paper, we present the design of -Space runtime system and provide some throughput evaluation results with our experimental prototype.
Impact of Power Control on Performance of IEEE 802.11 Wireless Networks
Authors: Ivan Wang-Hei Ho, Soung Chang Liew
Venue: IEEE Transactions on Mobile Computing (2007)

Optimizing spectral reuse is a major issue in large-scale IEEE 802.11 wireless networks. Power control is an effective means for doing so. Much previous work simply assumes that each transmitter should use the minimum transmit power needed to reach its receiver, and that this would maximize the network capacity by increasing spectral reuse. It turns out that this is not necessarily the case, primarily because of hidden nodes. This paper shows that in a network with power control, avoiding hidden nodes can achieve higher overall network capacity compared with the minimum-transmit-power approach. It is not always best to use the minimum transmit powers even from the network capacity viewpoint. Specifically, we propose and investigate two distributed adaptive power control algorithms that minimize mutual interferences among links while avoiding hidden nodes. Different power control schemes have different numbers of exposed nodes and hidden nodes, which in turn result in different network capacities and fairness. Although there is usually a fundamental tradeoff between network capacity and fairness, we show that, interestingly, this is not always the case. In addition, our power control algorithms can operate at desirable network- capacity-fairness tradeoff points, and can boost the capacity of ordinary non-power-controlled 802.11 networks by two times while eliminating hidden nodes.
Strategic Thinking, Practical Dreaming
Authors: Linda Wilbanks
Venue: IT Professional (2007)

We need to develop a vision of the end product before we can plan how to get there.
Capital-Intensive Software Technology Conclusion
Venue: IEEE Software (1984)

Periods of rapid technological change require more innovation and greater risks than periods of stability. 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
Digital Ecosystem for Cross-domain Context Sensing and Trading
Authors: Tom Pfeifer, Paul Malone
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

There is a need for exchange and trade of contextual information within ubiquitous computing environments between different providers of context-aware services. It is the need of a mobile user to obtain such services wherever he roams during the course of the day, such as home, workplace, leisure and visiting businesses, in a way that is safe and secure for both the user as well as the providers, while generating the maximum benefit from synergetically aggregating pieces of contextual information. A possible method to model the peer-to-peer relationships and complex structure of different interests is the introduction of Digital Ecosystems. The Digital Ecosystem is an emerging paradigm for economic and technological innovation. It consists of a self-organising digital infrastructure, aimed at creating a digital environment for networked organisations (or agents) thus supporting the cooperation, knowledge sharing and development of open and adaptive technologies and evolutionary, domain knowledge rich, environments.
An Interactive System for Finding Perfect Hash Functions
Authors: N. Cercone
Venue: IEEE Software (1985)

The interactive implementation of this hash function algorithm presents several examples of large lexicon design, illustrating how the minimality criterion and execution efficiency can vary when various problem parameters are adjusted.
Study of Word-Based Chinese Document Experimental System and Chinese Free-Text Information Extraction Experiment Based on It
Authors: Qian Liu, Hui Jiao, Hui-bo Jia
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper presents a Word-based Chinese Document Experimental System which is aimed to make Chinese Information Processing technology to develop on a more reliable and more efficient basis. This system implements the document storage and processing format, both of which are based on the smallest information carrier: Chinese word. Further an IE algorithm with two steps strategy for the Chinese free text is introduced. And then taking this document system as experimental platform, choosing the abstract part of Chinese Sci_Tech journals as the free text, the IE experiment which is conducted and get good results: accuracy ratio P is 95.03%, recall ratio R is 91.40% and F-value is 93.18%. From the experimental results, we can see that the Word-based Chinese Document System designed by us can promote the development of Chinese Information Processing technology to more advanced application stages.
Statistical modeling and analysis of laser-evoked potentials of electrocorticogram recordings from awake humans
Authors: Zhe Chen, Shinji Ohara, Jianting Cao, François Vialatte, Fred A. Lenz, Andrzej Cichocki
Venue: Computational Intelligence and Neuroscience (2007)

This article is devoted to statistical modeling and analysis of electrocorticogram (ECoG) signals induced by painful cutaneous laser stimuli, which were recorded from implanted electrodes in awake humans. Specifically, with statistical tools of factor analysis and independent component analysis, the pain-induced laser-evoked potentials (LEPs) were extracted and investigated under different controlled conditions. With the help of wavelet analysis, quantitative and qualitative analyses were conducted regarding the LEPs' attributes of power, amplitude, and latency, in both averaging and single-trial experiments. Statistical hypothesis tests were also applied in various experimental setups. Experimental results reported herein also confirm previous findings in the neurophysiology literature. In addition, single-trial analysis has also revealed many new observations that might be interesting to the neuroscientists or clinical neurophysiologists. These promising results show convincing validation that advanced signal processing and statistical analysis may open new avenues for future studies of such ECoG or other relevant biomedical recordings.
CAD/CAM Work Stations for Man-Model Communication
Authors: F. M. Lillehagen
Venue: IEEE Computer Graphics and Applications (1981)

A computer design system featuring modular architecture and local processing power permits natural interaction between the designer and the computer-based product model.
Structured Analysis (SA): A Language for Communicating Ideas
Authors: D. T. Ross
Venue: IEEE Transactions on Software Engineering (1977)

Structured analysis (SA) combines blueprint-like graphic language with the nouns and verbs of any other language to provide a hierarchic, top-down, gradual exposition of detail in the form of an SA model. The things and happenings of a subject are expressed in a data decomposition and an activity decomposition, both of which employ the same graphic building block, the SA box, to represent a part of a whole. SA arrows, representing input, output, control, and mechanism, express the relation of each part to the whole. The paper describes the rationalization behind some 40 features of the SA language, and shows how they enable rigorous communication which results frorn disciplined, recursive application of the SA maxim: "Everything worth saying about anything worth saying something about must be expressed in six or fewer pieces."
Systolic Multipliers for Finite Fields GF(2m)
Authors: C. -S. Yeh
Venue: IEEE Transactions on Computers (1984)

Two systolic architectures are developed for performing the product-sum computation AB + C in the finite field GF(2m) of 2melements, where A, B, and C are arbitrary elements of GF(2m). The first multiplier is a serial-in, serial-out one-dimensional systolic array, while the second multiplier is a parallel-in, parallel-out two-dimensional systolic array. The first m
Controlling access to published data using cryptography
Authors: Gerome Miklau, Dan Suciu
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We propose a framework for enforcing access control policies on published XML documents using cryptography. In this framework the owner publishes a single data instance, which is partially encrypted, and which enforces all access control policies. Our contributions include a declarative language for access policies, and the resolution of these policies into a logical "protection model" which protects an XML tree with keys. The data owner enforces an access control policy by granting keys to users. The model is quite powerful, allowing the data owner to describe complex access scenarios, and is also quite elegant, allowing logical optimizations to be described as rewriting rules. Finally, we describe cryptographic techniques for enforcing the protection model on published data, and provide a performance analysis using real datasets.
Developing staff schedules for a bilingual telecommunication call center with flexible workers
Authors: Kadir Ertogral, Bader Bamuqabel
Venue: Computers and Industrial Engineering (2008)

Call centers constitute growing and significant portions in national economies. This is due to the fact that the customer satisfaction has become the sole performance measure that drives the businesses today, and the call centers are the main means for companies to communicate with their customers. Additionally many public services, such as emergency and security services, cannot operate without their call centers. There is a vast body of literature on different aspects of the call center related problems. In this study, we describe a comprehensive methodology for developing staff schedules in a bilingual (Arabic and English) call center of a local telecommunication company. Our approach involves two main parts. First we obtain agent requirements in each hour across a week. In this part we use data analysis, a queuing approximation, and a simulation model. The second part is about constructing optimization models for scheduling agents. We utilize two models; one for the case with no flexible workers, and another for the case with flexible workers. We include numerical experiments and analysis at the end to show the schedule optimization results under several scenarios.
Application of AI techniques for locating mobile terminals in mobile wireless cellular networks: A novel paging scheme
Authors: Madhubanti Maitra, Amitava Chatterjee
Venue: Expert Systems with Applications: An International Journal (2008)

This work proposes a novel intelligent terminal paging scheme, which essentially employs a popular concept of AI, namely, rule-based technique. The scheme is so devised that it can design ''rules'' that potentially maps apparently disparate input data items (though having some regular stochastic relations) to an almost exact position of mobile terminals (MTs). The scheme, called RBPS^*, has been developed utilizing the conventional models of call arrival, cell residence time and microscopic mobility. As a mobility model, random-walk mobility and movement-based model have been utilized. Hence, a stochastic model has been developed to analyze the performance of the scheme. RBPS^* requires no additional processing overhead at MTs' end, though it involves a nominal overhead at the MSC end. This scheme not only attempts to resolve the issue of inherent tradeoff between the cost components, comprising paging and location update (LU) cost, it also reduces the total cost for location management, compared to the other schemes referred in this work. Simulation results can successfully demonstrate that the proposed RBPS^* significantly outperforms GSM-adopted blanket paging scheme and the popular shortest distance first (SDF) scheme. Another important point to be noted is that the proposed scheme, RBPS^*, is a generic one and can be deployed on-line. This scheme can potentially be also utilized in next generation wireless cellular networks, irrespective of any standards, by undertaking minor modifications, as required to conform to the respective standards.
Linking questions and evidence
Authors: Josh Tenenberg, Robert McCartney
Venue: Journal on Educational Resources in Computing (JERIC) (2008)

This special issue features a set of papers recently published in the 3rd International Workshop on Computing Education Research (ICER'07). The papers were selected because they closely meet the publication criteria for ACM/JERIC: stemming from computing education practice, grounded in relevant literature, containing analysis of primary empirical data collected to support specific claims, and providing implications for practice. In addition, the diverse set of research methods used demonstrates how empirical methods can be chosen to serve the specific questions of interest, whether for purposes of research or for improvement of teaching practice. This set of papers can therefore serve as examplars and resources for the educator wishing to develop a wider range of tools for probing issues of teaching and learning within the classroom.
A Multi-Subpopulation Particle Swarm Optimization: A Hybrid Intelligent Computing for Function Optimization
Authors: Montri Inthachot, Siriporn Supratid
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Like many other optimization algorithms, particle swarm optimization could be possibly stuck in a poor region of the search space or diverge to unstable situations. For relieving such problems, this paper proposes a hybrid intelligent computing: a multi-subpopulation particle swarm optimization. It combines the coarse-grained model of evolutionary algorithms with particle swarm optimization. This study utilizes two performance measurements: the correctness and the number of iterations required for finding the optimal solution. The results are obtained by testing the particle swarm optimization and multi-subpopulation particle swarm optimization on the same set of function optimizations. According to both types of performance measurement, the multi-subpopulation particle swarm optimization shows distinctly superior performance over the particle swarm optimization does. An additional set of experiments is performed on only the hard functions by adapting the algorithm parameters. With such adaptation, the improvement succeeds. All experiments are executed without taking parallel hardware into account.
Multi-layer interconnect performance corners for variation-aware timing analysis
Authors: Frank Huebbers, Ali Dasdan, Yehea Ismail
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Parasitic interconnect corner methods are known to be inaccurate. This paper explains the sources of their errors and shows that errors in excess of 22% can occur in the predicted corner delays of a multi-layer stage in the presence of process variations. It is shown that exhaustive corner search methods are infeasible in practice as they have an exponential complexity in terms of required SPICE simulations with respect to the number of layers a stage is routed through. This exponential complexity is reduced to a linear one with a new simulation-based search method with the aid of stage delay properties. The ideas behind the simulation-based methodology are shown to be expandable to an analytical-based multi-layer performance corner location methodology. The simulated best/worst case delays based on these analytical corners produce errors below 4% as compared to the exhaustive search simulation based method.
High confidence software for cyber-physical systems
Authors: Sherif Abdelwahed, Nagarajan Kandasamy, Aniruddha Gokhale
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

Many new and planned cyber-physical systems (CPSs) are realized as distributed real-time and embedded (DRE) systems. Examples of DRE CPSs we are interested in include data computing centers and automated warehouse management systems.
Bayesian Extensions to a Basic Model of Software Reliability
Authors: W. S. Jewell
Venue: IEEE Transactions on Software Engineering (1985)

A Bayesian analysis of the software reliability model of Jelinski and Moranda is given, based upon Meinhold and Singpurwalla. Important extensions are provided to the stopping rule and prior distribution of the number of defects, as well as permitting uncertainty in the failure rate. It is easy to calculate the predictive distribution of unfound errors at the end of software testing, and to see the relative effects of uncertainty in the number of errors and in the detection efficiency. The behavior of the predictive mode and mean over time are examined as possible point estimators, but are clearly inferior to calculating the full predictive distribution.
Industry Update
Authors: D. Mrazek
Venue: Computer (1972)

Designers of microprogrammed computers have been using solid-state, random-access memories as scratch- pads and solid-state read-only memo- ries to store microinstructions and program constants. TTL (transistor- transistor logic) integrated circuits are frequently chosen because TTL speed is high. 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
A Note On High-Speed Generation of Maximal Length Sequences
Authors: A. Y. C. Quan
Venue: IEEE Transactions on Computers (1974)

It is shown that high-speed generation of maximal length sequences can be realized by time division multiplexing instead of modulo-two adding the sequences obtained by decimation of a maximal length sequence. The advantage of this method is that higher speeds are obtainable.
The Efficient Security Architecture for Authentication and Authorization in the Home Network
Authors: Hyungkyu Lee, Jooyoung Lee, Jongwook Han
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Most people say that home network will become one of the most important things in the future industries and create high profit. Home network will grow to the direction that improves human life more conveniently. In the near future, the intelligent home environment where diverse home services are provided, there are various devices connected to the network and people can roam between homes will emerge in the human life. However, due to such a complexity of the home network, it will become more difficult for us to find an appropriate security mechanism for home network. In this paper, we present the efficient authentication and authorization architecture for smart home network. To achieve our goal, we consider the various characteristics of home network such as performance of home appliances, roaming between homes, privacy, etc.
Iterative Realization of Multivalued Logic Systems
Authors: V. P. Srini
Venue: IEEE Transactions on Computers (1979)

The realization of multivalued combinational functions and sequential machines by using arrays of one type of cells is considered. The algebra used for the multivalued logic system has two binary operations and a set of unary operations. Each of these operations is realized by a cellular array. The cells are combinational and implemented by using binary logic gates. The cells are also designed so that all unrestricted multiple faults in arrays of these cells are detectable. Multivalued combinational functions, storage elements, and sequential machines are realized by interconnecting the arrays realizing the operations.
A Novel GA-LM Based Hybrid Algorithm
Authors: Changsheng Zhang, Jigui Sun, Qiansheng Wang, Zhe Feng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In order to improve the model's learning capability and convergence rate, the GA and ANN are usually combined together. But the current combination ways have the insufficiencies of premature convergence, weak extensive ability etc. To overcome these shortcomings, we propose a new hybrid study algorithm-GALM, which uses the GA and LM in turn to optimize the neural network. we compare the GALM algorithm with other relevant algorithms through experimentation. The results indicate that our algorithm can effectively overcome the problem about falling into the local optimal solutions, and remarkably improved the network learning capability and the convergence rate.
Spherical-Homoscedastic Distributions: The Equivalency of Spherical and Normal Distributions in Classification
Authors: Onur C. Hamsici, Aleix M. Martinez
Venue: The Journal of Machine Learning Research (2007)

Many feature representations, as in genomics, describe directional data where all feature vectors share a common norm. In other cases, as in computer vision, a norm or variance normalization step, where all feature vectors are normalized to a common length, is generally used. These representations and pre-processing step map the original data from ℜp to the surface of a hypersphere Sp-1. Such representations should then be modeled using spherical distributions. However, the difficulty associated with such spherical representations has prompted researchers to model their spherical data using Gaussian distributions instead---as if the data were represented in ℜp rather than Sp-1. This opens the question to whether the classification results calculated with the Gaussian approximation are the same as those obtained when using the original spherical distributions. In this paper, we show that in some particular cases (which we named spherical-homoscedastic) the answer to this question is positive. In the more general case however, the answer is negative. For this reason, we further investigate the additional error added by the Gaussian modeling. We conclude that the more the data deviates from spherical-homoscedastic, the less advisable it is to employ the Gaussian approximation. We then show how our derivations can be used to define optimal classifiers for spherical-homoscedastic distributions. By using a kernel which maps the original space into one where the data adapts to the spherical-homoscedastic model, we can derive non-linear classifiers with potential applications in a large number of problems. We conclude this paper by demonstrating the uses of spherical-homoscedasticity in the classification of images of objects, gene expression sequences, and text data.
Is This the Party to Whom I Am Speaking?
Authors: Francis Sullivan
Venue: Computing in Science and Engineering (2007)

Contributing editor Francis Sullivan explores the phenomenon of phoney email scams and the "reality" of Wikipedia entries.