ppxscal/embedding_network huggingface dataset:
EACLE: Energy-Aware Clustering Scheme with Transmission Power Control for Sensor Networks
Authors: Kentaro Yanagihara, Jumpei Taketsugu, Kiyoshi Fukui, Shigeru Fukunaga, Shinsuke Hara, Ken-Ichi Kitayama
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we propose a new energy efficient clustering scheme with transmission power control named "EACLE" (Energy-Aware CLustering scheme with transmission power control for sEnsor networks) for wireless sensor networks, which are composed of the following three components; "EACLE clustering" is a distributed clustering method by means of transmission power control, "EACLE routing" builds a tree rooted at a sink node and sets the paths from sensor nodes taking energy saving into consideration, and "EACLE transmission timing control" changes the transmission timing with different levels of transmission power to avoid packet collisions and facilitates packet binding.With an indoor wireless channel model which we obtained from channel measurement campaigns in rooms and corridors and an energy consumption model which we obtained from a measurement of a chipset, we performed computer simulations to investigate the performance of EACLE in a realistic environment. Our simulation results indicate that EACLE outperforms a conventional scheme such as EAD (Energy-Aware Data-centric routing) in terms of communication success rate and energy consumption. Furthermore, we fully discuss the impact of transmission power and timing control on the performance of EACLE.
Efficient estimation of joint queries from multiple OLAP databases
Authors: Elaheh Pourabbas, Arie Shoshani
Venue: ACM Transactions on Database Systems (TODS) (2007)

Given an OLAP query expressed over multiple source OLAP databases, we study the problem of estimating the resulting OLAP target database. The problem arises when it is not possible to derive the result from a single database. The method we use is linear indirect estimation, commonly used for statistical estimation. We examine two obvious computational methods for computing such a target database, called the full cross-product (F) and preaggregation (P) methods. We study the accuracy and computational cost of these methods. While the F method provides a more accurate estimate, it is more expensive computationally than P. Our contribution is in proposing a third, new method, called the partial preaggregation method (PP), which is significantly less expensive than F, but just as accurate. We prove formally that the PP method yields the same results as the F method, and provide analytical and experimental results on the accuracy and computational benefits of the PP method.
Euromicro: the European Association for Microprocessing
Authors: Stanley Habib
Venue: ACM SIGMICRO Newsletter (1974)

Euromicro Correspondents (formerly National Representatives) must obtain the approval and support of their National Information Processing Societies in order to insure favorable working conditions for the Association.
The Design of efficient initialization and crash recovery for log-based file systems over flash memory
Authors: Chin-Hsien Wu, Tei-Wei Kuo, Li-Pin Chang
Venue: ACM Transactions on Storage (TOS) (2006)

While flash memory has been widely adopted for storage systems for various embedded systems, issues of performance and reliability have started receiving growing attention in recent years. How to provide efficient roll back and quick mounting for flash-memory file systems has become an important research topic in recent years, in addition to the work on effective garbage collection and superb runtime performance. Such an observation motivates our work on the investigation of efficient initialization and crash recovery of flash-memory file systems based on log structures. A methodology is proposed for the acceleration of mounting and crash recovery for log-based file systems. A system prototype based on a well-known flash-memory file system, YAFFS, was implemented with performance evaluation. Experimental results show that the proposed methodology can reduce mounting time significantly, regardless of whether the file system is properly unmounted.
A microprogramming strategy for HLL interpretation
Authors: J. Petit, D. Litaize, B. Lecussan, J. P. Sansonnet
Venue: ACM SIGMICRO Newsletter (1976)

The design of a processor suited for direct interpretation of any high level language is presented..
Mobile Computing, 1 edition
Authors: Asoke Talukder, Roopa Yavagal
Venue:  (2006)

The user in a mobile computing environment is able to access data from any device in a network while on the move, spread across wired and wireless media. The technology to deliver on this promise now exists, and is one of the key drivers for growth across the telecommunications industry. This book provides a detailed survery of the technologies delivering true mobile computing – on both the service creation and device fronts. This book guides communications professionals and students through the complex web of acronyms, standards that wireless data runs on. It also details hot button security issues and new emerging technologies.Table of contentsPREFACEACKNOWLEDGMENTSChapter 1: IntroductionChapter 2: Mobile Computing ArchitectureChapter 3: Mobile Computing Through TelephonyChapter 4: Emerging TechnologiesChapter 5: Global System for Mobile Communications (GSM)Chapter 6: Short Message Service (SMS)Chapter 7: General Packet Radio Service (GPRS)Chapter 8: Wireless Application Protocol (WAP)Chapter 9: CDMA and 3GChapter 10: Wireless LANChapter 11: Intelligent Networks and InterworkingChapter 12: Client ProgrammingChapter 13: Programming for the Palm OSChapter 14: Wireless Devices with Symbian OSChapter 15: J2MEChapter 16: Wireless Devices with Windows CEChapter 17: Voice over Internet Protocol and ConvergenceChapter 18: Security Issues in Mobile ComputingLIST OF ABBREVIATIONSINDEX
Maya 8 for Windows and Macintosh: Visual QuickStart Guide
Authors: Morgan Robinson, Nathaniel Stein
Venue:  (2007)

Adding sophisticated new tools that give modelers even more control over polygons, an already cool program just got even cooler. Here to take budding 3D artists from 0 to 60 fast in Maya 8 is the eagerly anticipated update to everybody's favorite Maya tome: Maya 8 for Windows and Macintosh: Visual QuickStart Guide! In these pages, best-selling authors Morgan Robinson and Nathaniel Stein use a combination of task-based instruction and strong visual aids to take readers step by step through all of Maya's essentials: navigating the interface, modeling elementary and complex objects, unsurpassed character rigging and posing, mastering deformers, shaders, and renderers, and more. Both beginning users, who want a thorough introduction to the topic, and more advanced users, who are looking for a convenient reference, will find what they need here in straightforward language and through readily accessible examples, peppered with tons of timesaving tips and tricks.ï¾
Database Performance Tuning on Aix (Ibm Redbooks)
Authors: Budi Darmawan
Venue:  (2003)

In-depth discussion on RDBMS performance characteristics Covers DB2 UDB V8, Oracle 9i, and Informix DS on AIX 5L Comprehensive tuning tips and examples This IBM Redbook is designed to help system designers, system administrators, and database administrators design, size, implement, maintain, monitor, and tune a Relational Database Management System (RDBMS) for optimal performance on AIX. RDBMS is usually a significant factor in building the profit line of a company. They represent an important investment and their performance is vital to the success of the company. This redbook contains hints and tips from experts that work on RDBMS performance every day. It also provides introductions to general database layout concepts from a performance point of view, design and sizing guidelines, tuning recommendations, and performance and tuning information for DB2 UDB, Oracle, and IBM Informix databases. The performance tips provided here relate to the things that a system administrator or database administrator can change. This book does not cover performance tuning issues that relate to application and database design, including SQL query tuning.
Toward the Fair Anonymous Signatures: Deniable Ring Signatures*The proceedings version of this paper [12] appeared in the cryptographers' track at the RSA Conference 2006 (CT-RSA 2006).
Authors: Yuichi Komano, Kazuo Ohta, Atsushi Shimbo, Shinichi Kawamura
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

Ring signature scheme enables a signer to sign a message anonymously. In the ring signature scheme, the signer who wants to sign a document anonymously first chooses some public keys of entities (signers) and then generates a signature which ensures that one of the signer or entities signs the document. In some situations, however, the ring signature scheme allows the signer to shift the blame to victims because of the anonymity. The group signature scheme may be a solution for the problem; however, it needs an electronic big brother, called a group manager, who can violate the signer anonymity by himself, and a complicated key setting. This paper introduces a new notion of a signature scheme with signer anonymity, a deniable ring signature scheme (<Dscr><Rscr><Sscr>), in which no group manager exists, and the signer should be involved in opening the signer anonymity. We also propose a concrete scheme proven to be secure under the assumption of the DDH (decision Diffie Hellman) problem in the random oracle model.
Applications of discrete-event simulation to support manufacturing logistics decision-making: a survey
Authors: Marco Semini, Hakon Fauske, Jan Ola Strandhagen
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper presents a literature survey on recent use of discrete-event simulation in real-world manufacturing logistics decision-making. The sample of the survey consists of 52 relevant application papers from recent Winter Simulation Conference proceedings. We investigated what decisions were supported by the applications, case company characteristics, some methodological issues, and the software tools used. We found that the majority of applications has been reported in production plant design and in the evaluation of production policies, lot sizes, WIP levels and production plans/schedules. Findings also suggest that general-purpose DES software tools are suitable in most of these cases. For different possible reasons, few applications for multi-echelon supply chain decision-making have been reported. Software requirements for supply chain simulations also seem to differ slightly from those for established application areas. The applications described were carried out in a variety of different industries, with a clear predominance in the semiconductor and automotive industries.
Further Analysis of ID-Based Authenticated Group Key Agreement Protocol from Bilinear Maps*This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2005-217-C00002).
Authors: Kyung-Ah Shim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

Recently, Choi et al. proposed an ID-based authenticated group key agreement with bilinear maps. Subsequently, Zhang and Chen showed that the protocol does not provide authenticity as claimed by replaying transcripts of the past session. To prevent those replay attacks, they suggest adding a time parameter to the message being signed. However, despite of such a modification, we show that the protocol is still insecure against insider colluding attacks without replaying transcripts of the past session.
Automatic generation of spoken dialogue from medical plans and ontologies
Authors: Martin Beveridge, John Fox
Venue: Journal of Biomedical Informatics (2006)

This paper presents some research undertaken as part of the EU-funded HOMEY project, into the application of intelligent dialogue systems to healthcare systems. The work presented here concentrates on the ways in which knowledge of underlying task structure (e.g., a medical guideline) can be combined with ontological knowledge (e.g., medical semantic dictionaries) to provide a basis for the automatic generation of flexible and re-configurable dialogue. This approach is next evaluated via a specific application that provides decision support to general practitioners to help determine whether or not a patient should be referred to a cancer specialist. The competence of the resulting dialogue application, its speech recognition performance, and dialogue performance are all evaluated to determine the applicability of this approach.
Finite element analysis of orifice-compensated multiple hole-entry worn hybrid journal bearing
Authors: R. K. Awasthi, S. C. Jain, Satish C. Sharma
Venue: Finite Elements in Analysis and Design (2006)

This paper presents the analysis of a non-recessed worn hybrid journal bearing with orifice restrictors. Using Newton-Raphson method, FEM is used for solving Reynolds equation governing the flow of lubricant in the bearing clearance space. The bearing performance characteristics are presented for a wide range of wear depth. The results are computed for an orifice-compensated hole-entry configuration with uniform distribution of holes in the circumferential direction. The results show that the wear affects the bearing performance significantly and therefore, a due consideration of wear defect should be given for an accurate prediction of the bearing performance over a number of cycles.
Interactive simulation
Authors: Sam Savage
Venue: Proceedings of the 38th conference on Winter simulation (2006)

A new generation of software performs Monte Carlo simulation nearly instantaneously on arbitrary spreadsheet models. In effect, it does for probability distributions what the spreadsheet did for numbers. In addition, the concept of a Stochastic Information System is introduced, in which distributions are stored as realizations of a stochastic process. A single variable is stored as a Stochastic Information Packet (SIP), a multivariate distribution as a Stochastic Library Unit, Relationships Preserved (SLURP). This leads to the Fundamental Equality of SLURP algebra: P(F(x, y)) = F(P(x, y)) where x and y are random variables, P(x, y) is the SLURP representing their joint distribution, and F is a function of x and y. Live computer demonstrations will include distribution arithmetic, the Flaw of Averages, a retirement simulation developed for a New York trust company, and interactive portfolio model used at a major petroleum firm.
MCSE/MCSA Managing and Maintaining a Windows Server 2003 Environment Study Guide (Exam 70-290), 1 edition
Authors: Anil Desai
Venue:  (2003)

The only classroom-based integrated study system for professional certification has been fully redesigned throughout--find out not only what to study, but how to study. You’ll get 100% complete coverage of all objectives for exam 70-290, hundreds of practice exam questions, and hands-on exercises. The CD-ROM features full practice exam software with interactive tutorials and lab simulations, plus an adaptive test engine. Table of contents 1: An Introduction to Windows Server 2003 2: Implementing and Managing Hardware 3: Managing Users, Groups, and Computers 4: Managing Resource Access 5: Managing Storage Resources 6: Managing and Implementing Disaster Recovery 7: Managing and Maintaining a Server Environment 8: Performance Monitoring and Optimization Appendix A: About the CD
Paraphrasing for automatic evaluation
Authors: David Kauchak, Regina Barzilay
Venue: Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (2006)

This paper studies the impact of paraphrases on the accuracy of automatic evaluation. Given a reference sentence and a machine-generated sentence, we seek to find a paraphrase of the reference sentence that is closer in wording to the machine output than the original reference. We apply our paraphrasing method in the context of machine translation evaluation. Our experiments show that the use of a paraphrased synthetic reference refines the accuracy of automatic evaluation. We also found a strong connection between the quality of automatic paraphrases as judged by humans and their contribution to automatic evaluation.
An aspect-oriented implementation of e-consent to foster trust
Authors: Keshnee Padayachee, J. H. P. Eloff
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

As society becomes increasingly dependent on software, there is an increasing expectation of information systems to protect the individual's right to privacy. The process of attaining electronic consent (e-Consent) may perhaps improve the trust that society has in information systems to protect these rights. However, an issue such as e-Consent is usually not given due consideration, as it is a non-functional issue and the implementation of the e-consent mechanism in disparate and legacy systems is difficult. Hence many systems are implemented without such types of controls. Evidently, aspect-oriented software design is highly extensible, as security concerns may be easily integrated into a completed software product. In this paper it is proposed that aspect-oriented programming be used to augment an existing system with electronic consent.
On the influence of the prior distribution in image reconstruction
Authors: Holger Rootzén, Jonny Olsson
Venue: Computational Statistics (2006)

Two measures of the influence of the prior distribution p(¿) in Bayes estimation are proposed. Both involve comparing with alternative prior distributions proportional to p(¿) s , for s ¿ 0. The first one, the influence curve for the prior distribution, is simply the curve of parameter values which are obtained as estimates when the estimation is made using p(¿) s instead of p(¿). It measures the overall influence of the prior. The second one, it the influence rate for the prior, is the derivative of this curve at s = 1, and quantifies the sensitivity to small changes or inaccuracies in the prior distribution. We give a simple formula for the influence rate in marginal posterior mean estimation, and discuss how the influence measures may be computed and used in image processing with Markov random field priors. The results are applied to an image reconstruction problem from visual field testing and to a stylized image analysis problem.
The Mac OS X Leopard Book
Authors: Andy Ihnatko
Venue:  (2007)

With so many books out there on Mac OS X Leopard, what makes this one better and different is its focus. While other Leopard books can regularly be 500-plus pages, this book cuts through all the technical jargon and gives you exactly what you want: the most important, most requested, and just plain coolest things about Leopard that will change the way you work on your Mac. With Leopard's newest features, this book will show you how to customize your workspace with Spaces, search and view your files fast with Quick Look, restore any file on your system with Time Machine, and much more. Each page covers just one topic, complete with full-color photos and screenshots, making it easy to find what you're looking for fast. 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 Dichotomic Search Algorithm for Mining and Learning in Domain-Specific Logics
Authors: Sébastien Ferré, Ross D. King
Venue: Fundamenta Informaticae (2004)

Many application domains make use of specific data structures such as sequences and graphs to represent knowledge. These data structures are ill-fitted to the standard representations used in machine learning and data-mining algorithms: propositional representations are not expressive enough, and first order ones are not efficient enough. In order to efficiently represent and reason on these data structures, and the complex patterns that are related to them, we use domain-specific logics. We show these logics can be built by the composition of logical components that model elementary data structures. The standard strategies of top-down and bottom-up search are ill-suited to some of these logics, and lack flexibility. We therefore introduce a dichotomic search strategy, that is analogous to a dichotomic search in an ordered array. We prove this provides more flexibility in the search, while retaining completeness and non-redundancy. We present a novel algorithm for learning using domain specific logics and dichotomic search, and analyse its complexity. We also describe two applications which illustrates the search for motifs in sequences; where these motifs have arbitrary length and length-constrained gaps. In the first application sequences represent the trains of the East-West challenge; in the second application they represent the secondary structure of Yeast proteins for the discrimination of their biological functions.
Study of PMMA thermal bonding
Authors: Xuelin Zhu, Gang Liu, Yuhua Guo, Yangchao Tian
Venue: Microsystem Technologies (2006)

The bond strength dependence on bonding temperature and bonding pressure in traditional thermal bonding and surface modification bonding of PMMA is investigated. The results show that the bond strength of the latter bonding method is larger than the former. The effects of post-annealing and aging on bond strength are also demonstrated. Then the bonding parameters of temperature and pressure are optimized, and typical bond strength of 1&#x00a0;MPa is obtained at bonding temperature of 95&#x00b0;C, bonding pressure at 2&#x00a0;MPa, bonding time for 3&#x00a0;min and 50&#x00b0;C post-annealing for 2&#x00a0;h. The successful bonded microfluidic device was obtained through this optimized thermal bonding method.
Learning for semantic parsing with statistical machine translation
Authors: Yuk Wah Wong, Raymond J. Mooney
Venue: Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (2006)

We present a novel statistical approach to semantic parsing, WASP, for constructing a complete, formal meaning representation of a sentence. A semantic parser is learned given a set of sentences annotated with their correct meaning representations. The main innovation of WASP is its use of state-of-the-art statistical machine translation techniques. A word alignment model is used for lexical acquisition, and the parsing model itself can be seen as a syntax-based translation model. We show that WASP performs favorably in terms of both accuracy and coverage compared to existing learning methods requiring similar amount of supervision, and shows better robustness to variations in task complexity and word order.