ppxscal/embedding_network huggingface dataset:
Data Privacy through Optimal k-Anonymization
Authors: Roberto J. Bayardo, Rakesh Agrawal
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Data de-identification reconciles the demand for release of data for research purposes and the demand for privacy from individuals. This paper proposes and evaluates an optimization algorithm for the powerful de-identification procedure known as k-anonymization. A k-anonymized dataset has the property that each record is indistinguishable from at least k - 1 others. Even simple restrictions of optimized k-anonymity are NP-hard, leading to significant computational challenges. We present a new approach to exploring the space of possible anonymizations that tames the combinatorics of the problem, and develop data-management strategies to reduce reliance on expensive operations such as sorting. Through experiments on real census data, we show the resulting algorithm can find optimalk-anonymizations under two representative cost measures and a wide range of k. We also show that the algorithm can produce good anonymizations in circumstances where the input data or input parameters preclude finding an optimal solution in reasonable time. Finally, we use the algorithm to explore the effects of different coding approaches and problem variations on anonymization quality and performance. To our knowledge, this is the first result demonstrating optimal k-anonymization of a nontrivial dataset under a general model of the problem.
A Compact Broadband Tactile Display and Its Effectiveness in the Display of Tactile Form
Authors: Ki-Uk Kyung, Minseung Ahn, Dong-Soo Kwon, Mandayam A. Srinivasan
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper describes the development of a planar distributed tactile display, and tests its effectiveness for displaying textures. The tactile display is composed of a 6×5 pin array actuated by 30 piezoelectric bimorphs. The pins lie on 1.8 mm centers. Vertical excursion of each pin is controlled over a 0-0.7mm range. Perceptual experiments were conducted to evaluate the performance of the system under three conditions: active touch, passive touch with vibration, and passive touch without vibration.
Artificial Neural Networks Applied to Long-Term Electricity Demand Forecasting
Authors: Mostafa Al Mamun, Ken Nagasaka
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The electric power demand in Japan has steadily increased and the load factor of total power system has de-creased. It is therefore very important to the utilities to have advance knowledge of their electrical load. One of the important points for forecasting the long-term load in Japan is to take into account the past and present economic situations and power demand. These points were considered in this study. The proposed Artificial Neural Network (ANN) that is Radial Basis Function Network (RBFN) has also showed that the changes in loads are a reflection of economy. Here, prediction of peak loads in Japan up to year 2015 is discussed using the RBFN and the maxi-mum demands for 2001 through 2015are predicted to be elevated from 179.42GW to 209.18GW. The annual average rate of load growth seen per ten years until 2015 is about 1.39%.
Towards Prediction of Environmental Arctic Change
Authors: Wieslaw Maslowski
Venue: Proceedings of the 2004 Users Group Conference (2004)

Our main objective is to use models of the coupled ice-ocean Arctic environment to understand the past and present sea ice and ocean states and to predict future scenarios of environmental change in the Arctic Ocean. To meet this objective we have developed a coupled ice-ocean model of the sea ice covered northern hemisphere at 9-km and 45-level grid. The model has been spun up for 48 years. Three 24-year experiments have been completed following the spinup, all forced with realistic 1979-2002 ECMWF data but with a different surface temperature and salinity restoring times. Results from these integrations are compared to each other and to sea ice data available over this period to address the growing need for understanding the recent warming and the subsequent decrease of the Arctic Ice Pack during the late 1990s and 2000s.
First-price path auctions
Authors: Nicole Immorlica, David Karger, Evdokia Nikolova, Rahul Sami
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their bid amount; the designer has flexibility in specifying remaining details. We assume edges are independent agents with fixed capacities and costs, and their objective is to maximize their profit. We characterize all strong ε-Nash equilibria of a first-price auction, and show that the total payment is never significantly more than, and often less than, the well known dominant strategy Vickrey-Clark-Groves mechanism. We then present a randomized version of the first-price auction for which the equilibrium condition can be relaxed to ε-Nash equilibrium. We next consider a model in which the amount of demand is uncertain, but its probability distribution is known. For this model, we show that a simple ex ante first-price auction may not have any ε-Nash equilibria. We then present a modified mechanism with 2-parameter bids which does have an ε-Nash equilibrium. For a randomized version of this 2-parameter mechanism we characterize the set of all eNEs and prove a bound on the total payment in any eNE.
Performance Evaluation of Ad-Hoc WLAN by M/G/1 Queueing Model
Authors: Sheng-Tzong Cheng, Mingzoo Wu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The distributed coordination function (DCF) is specified for both ad-hoc and infrastructure network configurations in the IEEE 802.11 standard. In this paper, we present an analytic model for evaluating the performance at nodes in a DCF based ad-hoc network without the assumption of saturation condition made in previous works. We model each node as a discrete time M/G/1 queue and describe the distribution of the DCF virtual service time by means of probability generating function (PGF), and further, obtain the average packet queueing delay and response time. Three adjustable input parameters are the number of stations n, packet arrival rate ¿, and average payload length E[P]. The analytical results are validated through extensive simulations, and it is shown that the model has significant high accuracy.
A paradigm for community-based human computer interaction education
Authors: John D. Fernandez
Venue: Journal of Computing Sciences in Colleges (2004)

With the pervasiveness of computers throughout our environment, there is a growing demand for diligent Human Computer Interaction (HCI) education of graduate and undergraduate students to satisfy the growing needs of a multiplicity of organizations. This paper describes one approach to teaching HCI while requiring students to develop systems for various city, school, and university organizations. The benefits derived by the students and the clients receiving their services are many. There is wide range of opportunities for community-based HCI education. The various client applications provide a plethora of learning scenarios that may be explored in a classroom setting. The process, experience, and results are presented in this paper.
Adobe Photoshop Revealed
Authors: Elizabeth Eisner Reding
Venue:  (2005)

Coverage includes- Allows readers to master Photoshop concepts both technically and artistically by explaining both the "how" and the "why" behind each skill Provides step-by-step, comprehensive instruction on Photoshop techniques, from basic to more advanced skills.
Counterexamples and conjectures
Venue: Issue 30 (July 1984) (1971)

This section of the newsletter will carry counterexamples and conjectures which are of interest to our readers but which will not normally be published elsewhere. Most of these counterexamples and conjectures concern completeness of some resolution based theorem proving procedure but others are welcomed. Some of these conjectures and/or counterexamples may be well known. We welcome such information and other examples. 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
Modular Analytical Performance Models for Ad Hoc Wireless Networks
Authors: Fernando L. Dotti, Paulo Fernandes, Afonso Sales, Osmar M. dos Santos
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

Wireless ad hoc networks raised a series of challenging research tracks. In order to analyze and validate research results achieved, thorough performance evaluation efforts are needed. In this context, the contribution of this paper is twofold: at the one side we investigate the effect of forwarding in wireless ad hoc networks, drawing the throughput behavior under variation of connectivity, interference and number of sources; on the other side we propose Stochastic Automata Networks (SAN) as a formalism well suited to the area because of its modularity, allowing model reuse and the structured stepwise representation of important aspects of the reality, and due to its ability to deal with models of considerable sizes, allowing the analytical evaluation of more complex situations.
Lower bounds for k-DNF resolution on random 3-CNFs
Authors: Michael Alekhnovich
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k ≤ √ log n ⁄ log log n. For this we design a specially tailored random restrictions that preserve the structure of the input random 3-CNF while mapping every k-DNF with large covering number to 1 with high probability. Next we make use of the switching lemma for small restrictions by Segerlind, Buss and Impagliazzo to prove the lower bound.This work improves the previously known lower bound for Res(2) system on random 3-CNFs by Atserias, Bonet and Esteban and the result of Segerlind, Buss, Impagliazzo stating that random O(k2)-CNF do not possess short Res(k) refutations.
Instruments of cognition: use of citations and web links in online teaching materials
Authors: Anita Coleman
Venue: Journal of the American Society for Information Science and Technology (2005)

Use of citations and Web links embedded in online teaching materials was studied for an undergraduate course. The undergraduate students enrolled in Geographic Information Science for Geography and Regional Development used Web links more often than citations, but clearly did not see them as key to enhancing learning. Current conventions for citing and linking tend to make citations and links invisible. There is some evidence that citations and Web links categorized and highlighted in terms of their importance and function to be served may help student learning in interdisciplinary domains.
Stiff ordinary differential equation test problems
Authors: A. R. Curtis
Venue: ACM SIGNUM Newsletter (1973)

Many practical methods for integrating stiff systems of ordinary differential equations are based on underlying theory whose validity is only beyond doubt where the eigenvector system of the Jacobian matrix is constant. Realisation of this fact led the author to develop a range of simple linear test problems, which are described in this note, and which have been found to set severe tasks for a program based on Gear's method [1], but improved by the author.
Personalized Course Navigation Based on Grey Relational Analysis
Authors: Hahn-Ming Lee, Chi-Chun Huang, Tzu-Ting Kao
Venue: Applied Intelligence (2005)

Web personalization has quickly changed from a value-added facility to a service required in presenting large quantities of information because individual users of the Internet have various needs and preferences in seeking information. This paper presents a novel personalized recommendation system with online preference analysis in a distance learning environment called Coursebot. Users can both browse and search for course materials by using the interface of Coursebot. Moreover, the proposed system includes appropriate course materials ranked according to a user's interests. In this work, an analysis measure is proposed to combine typical grey relational analysis and implicit rating, and thus a user's interests are calculated from the content of documents and the user's browsing behavior. This algorithm's low computational complexity and ease of adding knowledge support online personalized analysis. In addition, the user profiles are dynamically revised to provide efficiently personalized information that reflects a user's interests after each page is visited.
Token+constraint systems for tangible interaction with digital information
Authors: Brygg Ullmer, Hiroshi Ishii, Robert J. K. Jacob
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2005)

We identify and present a major interaction approach for tangible user interfaces based upon systems of tokens and constraints. In these interfaces, tokens are discrete physical objects which represent digital information. Constraints are confining regions that are mapped to digital operations. These are frequently embodied as structures that mechanically channel how tokens can be manipulated, often limiting their movement to a single degree of freedom. Placing and manipulating tokens within systems of constraints can be used to invoke and control a variety of computational interpretations.We discuss the properties of the token+constraint approach; consider strengths that distinguish them from other interface approaches; and illustrate the concept with eleven past and recent supporting systems. We present some of the conceptual background supporting these interfaces, and consider them in terms of Bellotti et al.'s [2002] five questions for sensing-based interaction. We believe this discussion supports token+constraint systems as a powerful and promising approach for sensing-based interaction.
ArraySolver: an algorithm for colour-coded graphical display and Wilcoxon signed-rank statistics for comparing microarray gene expression data: Short Communications
Authors: Haseeb Ahmad Khan
Venue: Comparative and Functional Genomics (2004)

The massive surge in the production of microarray data poses a great challenge for proper analysis and interpretation. In recent years numerous computational tools have been developed to extract meaningful interpretation of microarray gene expression data. However, a convenient tool for two-groups comparison of microarray data is still lacking and users have to rely on commercial statistical packages that might be costly and require special skills, in addition to extra time and effort for transferring data from one platform to other. Various statistical methods, including the t-test, analysis of variance, Pearson test and Mann&ndash;Whitney U test, have been reported for comparing microarray data, whereas the utilization of the Wilcoxon signed-rank test, which is an appropriate test for two-groups comparison of gene expression data, has largely been neglected in microarray studies. The aim of this investigation was to build an integrated tool, ArraySolver, for colour-coded graphical display and comparison of gene expression data using the Wilcoxon signed-rank test. The results of software validation showed similar outputs with ArraySolver and SPSS for large datasets. Whereas the former program appeared to be more accurate for 25 or fewer pairs (n &le; 25), suggesting its potential application in analysing molecular signatures that usually contain small numbers of genes. The main advantages of ArraySolver are easy data selection, convenient report format, accurate statistics and the familiar Excel platform. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The Design and Evaluation of a Vibrotactile Progress Bar
Authors: Stephen A. Brewster, Alison King
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We present an investigation into the use of Tactons to present progress information. Progress bars are common but must compete for screen space and visual attention with other visual tasks. We created a tactile progress indicator, encoding progress into a series of vibrotactile pulses. An experiment comparing the tactile progress indicator to a standard visual one showed a significant improvement in performance and an overall preference for the tactile display.
An approach for response generation of restricted Bulgarian natural language queries
Authors: Silyan Arsov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper presents our researches in formation of methodology for accomplishment database management system with a restricted Bulgarian natural language interface. It is proposed a method for formulation of the query constructions in a restricted Bulgarian natural language, which is based on the elegant theory of the relational algebra. Within the framework of researches it is introduced system tools for formulation of the user's query. It is proposed an algorithm for response generation, which includes semantic analysis of a user's query and method for direct access to data.
Connected triangle-free m-step competition graphs
Authors: Geir T. Helleloid
Venue: Discrete Applied Mathematics (2005)

In 1968, Cohen presented competition graphs in connection with the study of ecological systems. Recently, Cho, Kim and Nam introduced a generalization called the m-step competition graph. In this paper, we characterize connected triangle-free m-step competition graphs on n vertices for m≥n. The analogous result follows for same-step competition graphs. We also demonstrate that the path on n vertices is an (n - 1)-step and an (n - 2)-step competition graph. Finally, we resolve a question of Cho, Kim and Nam on an inequality between 1-step and m-step competition numbers.
On the energy-efficiency of speculative hardware
Authors: Nana B. Sam, Martin Burtscher
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Microprocessor trends are moving towards wider architectures and more aggressive speculation. With the increasing transistor budgets, energy consumption has become a critical design constraint. To address this problem, several researchers have proposed and evaluated energy-efficient variants of speculation mechanisms. However, such hardware is typically evaluated in isolation and its impact on the energy consumption of the rest of the processor, for example, due to wrong-path executions, is ignored. Moreover, the available metrics that would provide a thorough evaluation of an architectural optimization employ somewhat complicated formulas with hard-to-measure parametersIn this paper, we introduce a simple method to accurately compare the energy-efficiency of speculative architectures. Our metric is based on runtime analysis of the entire processor chip and thus captures the energy consumption due to the positive as well as the negative activities that arise from the speculation activities. We demonstrate the usefulness of our metric on the example of value speculation, where we found some proposed value predictors, including low-power designs, not to be energy-efficient
Modeling and implementing software architecture with acme and archJava
Authors: Marwan Abi-Antoun, Jonathan Aldrich, David Garlan, Bradley Schmerl, Nagi Nahas, Tony Tseng
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We demonstrate a tool to incrementally synchronize an Acme architectural model described in the Acme Architectural Description Language (ADL) with an implementation in ArchJava, an extension of the Java programming language that includes explicit architectural modeling constructs.
The specification language T
Authors: Boris Sunik
Venue: ACM SIGPLAN Notices (2005)

The non-executable language T belongs to the class of open languages initially defined in [Sunik 1,2]. Open languages are artificial human languages with the grammar of OO programming languages. Similar to a natural language, an open language is not confined to any particular representation domain and may be applied in any tasks requiring explicit informing. T can be used for producing OO specifications of various entities representing software, hardware, technical appliances, biology systems, knowledge representation systems, etc. It also allows explicit representation of semantics of programming languages and produces executable code compliant with the semantics represented.
Load-balancing Strategy of Multi-gateway for Ad hoc Internet Connectivity
Authors: Jin H. Zhao, Xiao Z. Yang, Hong W. Liu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Mobile ad hoc networks (MANET) are autonomous, infrastructureless networks that support multi-hop communication through IP routing. MANET and Internet have many differences. These differences are not only the structure and topology of the networks, but also communication patterns of nodes in both networks. Therefore, it is a challenging problem for MANET to access to the Internet due to these differences. There are many kinds of accessing mode such as single fix gateway or multi-gateway, where load-balancing is the most important problem. In this paper, we propose the dynamic gateway concept that acts as an interface between MANET and the Internet. These dynamic gateways can use Mobile IP and DSDV protocol when they communicate with the internet and interact with MANET, respectively. The dynamic gateway is used to solve the load-balancing problem. Several simulation experimental results in the dynamic gateway environment show that the performance of network has been improved.
On paging with locality of reference
Authors: Susanne Albers, Lene M. Favrholdt, Oliver Giel
Venue: Journal of Computer and System Sciences (2005)

Motivated by the fact that competitive analysis yields too pessimistic results when applied to the paging problem, there has been considerable research interest in refining competitive analysis and in developing alternative models for studying online paging. In this paper, we propose a new, simple model for studying paging with locality of reference. The model is closely related to Denning's working set concept and directly reflects the amount of locality that request sequences exhibit. We use the page fault rate to evaluate the quality of paging algorithms, which is the performance measure used in practice. We develop tight or nearly tight bounds on the fault rates achieved by popular paging algorithms such as LRU, FIFO, deterministic Marking strategies and LFD. These bounds show that LRU is an optimal online algorithm, whereas FIFO and Marking strategies are not optimal in general. We present an experimental study comparing the page fault rates proven in our analyses to the page fault rates observed in practice.