ppxscal/embedding_network huggingface dataset:
Navigating computer science research through waves of privacy concerns: discussions among computer scientists at Carnegie Mellon University
Authors: Latanya Sweeney
Venue: ACM SIGCAS Computers and Society (2004)

Computer Science research and practice are raising growing privacy concerns among the public and government. Computer technology's increasing ability to capture, organize, interpret and share data about individuals raises questions about what privacy practices computer science researchers should adopt, if any. These issues are already very real in ongoing research projects in the School of Computer Science (SCS) at Carnegie Mellon University, from mining databases of individual transactions, to studying how people use the web, to mounting cameras in lounges, to building hallway robots that capture data about passers by, to building intelligent workstation assistants that learn user habits. This article introduces the nature of privacy concerns related to computer science research and explains potential benefits and risks (especially of abuse and misuse). Traditional methods for providing privacy assurances in research, such as Institutional Review Boards (IRBs), are examined, and innovative new approaches, such as privacy technology, are introduced.
Graph operations characterizing rank-width
Authors: Bruno Courcelle, Mamadou Moustapha Kanté
Venue: Discrete Applied Mathematics (2009)

Graph complexity measures such as tree-width, clique-width and rank-width are important because they yield Fixed Parameter Tractable algorithms. These algorithms are based on hierarchical decompositions of the considered graphs, and on boundedness conditions on the graph operations that, more or less explicitly, recombine the components of decompositions into larger graphs. Rank-width is defined in a combinatorial way, based on a tree, and not in terms of graph operations. We define operations on graphs that characterize rank-width and help for the construction of Fixed Parameter Tractable algorithms, especially for problems specified in monadic second-order logic.
Discovering semantic associations among Web services based on the qualitative probabilistic network
Authors: Kun Yue, Weiyi Liu, Xiaoling Wang, Aoying Zhou, Jin Li
Venue: Expert Systems with Applications: An International Journal (2009)

In recent years, the intelligent management and decision of Web services have attracted more and more attention due to the wide applications in various aspects of the real world. With the increase of Web services in an organization, the desired on-line services should be located rapidly requiring not only the syntactic but also the semantic techniques. In addition, aiming at fulfilling complex applications by discovering and composing available services automatically and precisely, it is indispensable to develop an underlying model and the corresponding measure for semantic associations among given Web services. In this paper, by mining the historical invocations of component services, we first construct a semantic model to describe their behavior rules based on the qualitative probabilistic network. Further, we propose a distance measure and the approach to discovering semantic associations among Web services. Preliminary experiments and performance studies show that our methods are feasible. Moreover, high recall and precision can be achieved when our methods are applied to Web service search.
A Novel Red-Eye Correction Method Based on AdaBoost Algorithm for Mobile Phone and Digital Camera
Authors: Weini Feng, Hui Li, Kai Lei
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Caused by light reflected off the subject's retina, red-eye is a troublesome problem in consumer photography. Correction of red eyes without any human intervention is an important task. There are some algorithms existing for red-eye detection, but almost all of them have less accuracy, in addition, they cannot support both high pixel and single red-eye. In this paper, a novel approach is proposed to eliminate red-eyes in the digital images automatically with a satisfactory result. This method gets the face region first by AdaBoost algorithm and then detects the red-eye on the top part of the face region, corrects the red-eye in the eye region for recovering the image's original color at last. Experiments in the platform of mobile phone and digital camera show that this method can eliminate the red-eye with high accuracy of 87%, which is higher than the best known technology of face detection base on complexion by 7%, and it can also support 8 million pixels image, moreover, the method has advantages of robustness and real-time computability.
A parallel/vectorized double-precision exponential core to accelerate computational science applications
Authors: Robin Pottathuparambil, Ron Sass
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Many natural processes exhibit exponential decay and, consequently, computational scientists make extensive use of e-χx in computer simulation experiments. While it is common to implement transcendental functions (sine, cosine, exponentiation, etc.) in hardware using the well-known CORDIC algorithm, many contemporary FPGA implementations either use fixed point or reduced precision floating-point operations (which suffers from a high average/mean error). Unfortunately, these solutions are unacceptable for many computational scientist who require the accuracy of doubleprecision values. This paper presents a direct implementation of an IEEE 754 double-precision e-χx FPGA core to support computational science applications. The design is similar to CORDIC but has been modified to specifically support exponentiation; it is pipelined and parallel to efficiently handle large vectors of parameters. Compared to solutions described in the literature, it consumes lesser logical gates, enabling more e-χx cores per FPGA. The paper compares the implementation to the current prevailing approaches. Results shows that the implementation on the Virtex 4 XC4VFX60 FPGA achieves a correct precise double-precision e-χx values, with a high throughput.
Designing robust copy protection for software products
Authors: Eugene Genov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper begins with a short description of the situation on the software market and the various types of software piracy threatening the industry. Follows a review of the currently available methods for copy protection, with evaluation of their strong and weak points. Based on this data, a new type of hardware approach for achieving highly-efficient copy protection is suggested, followed by description of the most important issues concerning its practical implementation on a larger scale.
Definition and analysis of composition structures for discrete-event models
Authors: Mathias Röhl, Adelinde M. Uhrmacher
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The re-use of a model by someone else than the original developer is still an open challenge. This paper presents composition structures and interface descriptions for discrete-event models. Interfaces are introduced as separate units of description that complement model definitions. As XML documents, interfaces may be stored in databases to search, select, and analyze composition candidates based on public visible property descriptions. A meta model formalizes interfaces, components, and compositions, such that the refinement of interfaces into model implementations and the compatibility of interfaces can be analyzed. The composition approach combines different hierarchical relations (type hierarchies, refinement hierarchies, and composition hierarchies) to simplify the modeling process.
Size matters: lessons from a broken binary search
Authors: Eric Shade
Venue: Journal of Computing Sciences in Colleges (2009)

As reported in the Google Research Blog, nearly all binary search and merge sort implementations are broken because of an integer overflow bug. The bug does not appear unless the array being searched/sorted is quite large (over a billion elements), which is why it has remained undetected for decades. There is a tendency to dismiss such overflow bugs as mere trivia, but this is a mistake. This paper reviews the bug, some common but incorrect solutions, and a correct solution. More important, it distills lessons to be learned from the bug, and provides specific recommendations for computer science educators to help their students cope with such bugs in the future.
Watch Me!
Authors: Yasushi Noguchi, Hideyuki Ando
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

Watch Me! is an experimental installation dedicated to documenting social bind (defined below) by intervening in a public space. It observes the behaviour of people's "eyes" using a robot bear as an unusual event.
A Novel Video Text Detection and Localization Approach
Authors: Xiaodong Huang, Huadong Ma, Haidong Yuan
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Text detection and localization in videos are often used for video information indexing and retrieval, as text can retrieve the semantic information of videos. In this paper, we propose a novel approach to detect and localize texts by means of integrating the multiple video frames and multiple video frame motion features. For text detection, first, the motion feature detection is employed to fulfill the multiple frame verification. Second, the synthesized motion feature image, which is produced by motion vector on consecutive frames, is used to detect the text region under a synthesized image, which is produced by multiframe integration. Third, corner points are employed to locate the candidate text pixels position and a region growing algorithm is developed to connect these pixels into text blocks. In text localization, we use the corner points to accurately locate the text region. Experimental results show satisfying performance of the proposed algorithm.
Proceedings of the May 19-22, 1980, national computer conference
Venue: AFIPS Joint Computer Conferences (1980)

The Proceedings of the 1980 National Computer Conference is the most comprehensive review of the current developments in the computing industry. This record of the 1980 NCC Program now becomes a part of the industry's history, and stands as a tribute to Program Chairman Dr. Donald Medley and his committee. With the usability of the computer as an underlying theme of the program, Dr. Medley's committee, the authors whose papers are included in this volume, and many others devoted considerable time and energy during the past year to assure that this program would be useful and informative to all attendees. They are to be commended for their efforts. Special recognition should be given, also, to the many panelists and speakers who participated in the 1980 NCC Program in a manner that went beyond the formal paper presentations included in these Proceedings. It is my sincere hope that you were able to attend some portion of the program at the 1980 NCC, and that this volume of the Proceedings will be a useful source of information for you for many years to come. 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
Knowledge extracting platform based on web service
Authors: Meiqun Liu, Kun Gao
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

In this paper, we proposed a novel knowledge extraction mechanism which based on E-delivery pattern. The new mechanism can solve efficiently some problem coming from nodes having data resources but lack of computing power, or some node with computing power but no data resource and low transmission bandwidth. The kernel of the system we proposed adopts OGSA as the foundation and provides open service for systematic expansion.
Information Density Estimation for Content Retrieval in MANETs
Authors: Marco Fiore, Claudio Casetti, Carla-Fabiana Chiasserini
Venue: IEEE Transactions on Mobile Computing (2009)

The paper focuses on a cooperative environment in wireless ad hoc networks, where mobile nodes share information in a peer-to-peer fashion. Nodes follow a pure peer-to-peer approach (i.e., without the intervention of servers), thus requiring an efficient query/response propagation algorithm to prevent network congestion. The main contribution of the paper is the proposal of a novel solution, called Eureka, that identifies the regions of the network where the required information is more likely to be stored and steers the queries toward those regions. To discriminate among regions, the concept of information density is introduced, along with a procedure that allows nodes its estimation. Eureka does not require the use of satellite positioning systems, and proves to be very effective in both vehicular and pedestrian environments.
The role of an information analysis center in software engineering technology transfer
Authors: Jon Martens, Lorraine Duvall
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

As software engineering advances into its second decade, the ideas, principles and practices conceived in its first decade need to be assimilated into a workable set of tools and techniques that can be dispersed to software developers for their use in the production of software. The need for this technology transfer is clear and immediate. Without the proper transfer of software engineering technology from software engineering researcher to developer, the software world will be unable to extricate itself from its present predicament. This predicament has been characterized by Meyers as follows: "The general character of the software predicament can be seen clearly, although consistent numbers with which to characterize it more precisely are hard to come by. Because less expensive hardware is bringing more applications within economic reach, the amount of software to be developed is increasing. Also because more software is already in existence, there is more to be maintained. But the productivity of programmers is improving rather slowly, especially by the standards of hardware price/performance, with the result that the overall cost of software development is tending to increase".
The Data Documentation Initiative (DDI)
Authors: Joachim Wackerow
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

The Data Documentation Initiative (DDI) is an international effort to establish an XML-based standard for the compilation, presentation, and exchange of documentation for datasets in the social and behavioral sciences. The most recent version 3.0 of the DDI supports a rich and structured set of metadata elements that not only fully informs a potential data analyst about a given dataset but also facilitates computer processing of the data. Moreover, data producers will find that by adopting the DDI standard they can produce better and more complete documentation as a natural step in designing and fielding computer-assisted interviewing.
Using soft-edge flip-flops to compensate NBTI-induced delay degradation
Authors: Karthik Duraisami, Enrico Macii, Massimo Poncino
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

We present a low-overhead solution to tackle the delay increase caused by Negative Bias Temperature Instability (NBTI), which has emerged as the most critical reliability issue in sub-90nm technology nodes. The proposed solution consists of using special type of registers, called soft-edge flip-flops (SEFFs), which allow to compensate for the delay increase by introducing a transparency window. SEFFs are an effective alternative to existing solutions such as threshold, supply, or body-bias voltage modulation, since they provide minimum area and power overhead, and can seamlessly replace regular FFs. Results show that delay degradation up-to 60ps after 10 years of aging can be accounted for with a very small (less than 1%) area penalty.
A graphics package for the first day and beyond
Authors: Michael H. Goldwasser, David Letscher
Venue: ACM SIGCSE Bulletin (2009)

We describe cs1graphics, a new Python drawing package designed with pedagogy in mind. The package is simple enough that students can sit down and make use of it from the first day of an introductory class. Yet it provides seamless support for intermediate and advanced lessons as students progress. In this paper, we discuss its versatility in the context of an introductory course. The package is available at www.cs1graphics.org.
Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
Authors: Vladimir Britanak, Huibert J. Lincklaen Arriëns
Venue: Signal Processing (2009)

A new fast computational structure identical both for the forward and backward modified discrete cosine/sine transform (MDCT/MDST) computation is described. It is the result of a systematic construction of a fast algorithm for an efficient implementation of the complete time domain aliasing cancellation (TDAC) analysis/synthesis MDCT/MDST filter banks. It is shown that the same computational structure can be used both for the encoder and the decoder, thus significantly reducing design time and resources. The corresponding generalized signal flow graph is regular and defines new sparse matrix factorizations of the discrete cosine transform of type IV (DCT-IV) and MDCT/MDST matrices. The identical fast MDCT computational structure provides an efficient implementation of the MDCT in MPEG layer III (MP3) audio coding and the Dolby Labs AC-3 codec. All steps to derive the computational structure are described in detail, and to put them into perspective a comprehensive list of references classified into categories is provided covering new research results achieved in the time period 1999-2008 in theoretical and practical developments of TDAC analysis/synthesis MDCT/MDST filter banks (general mathematical, symmetry and special properties, fast MDCT/MDST algorithms and efficient software/hardware implementations of the MDCT in MP3).
xCalls: safe I/O in memory transactions
Authors: Haris Volos, Andres Jaan Tack, Neelam Goyal, Michael M. Swift, Adam Welc
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolated. Thus, programs using transactions do not suffer from deadlock. However, when a transaction performs I/O or accesses kernel resources, the atomicity and isolation guarantees from the TM system do not apply to the kernel. The xCall interface is a new API that provides transactional semantics for system calls. With a combination of deferral and compensation, xCalls enable transactional memory programs to use common OS functionality within transactions. We implement xCalls for the Intel Software Transactional Memory compiler, and found it straightforward to convert programs to use transactions and xCalls. In tests on a 16-core NUMA machine, we show that xCalls enable concurrent I/O and system calls within transactions. Despite the overhead of implementing transactions in software, transactions with xCalls improved the performance of two applications with poor locking behavior by 16 and 70%.
Peer-to-peer community management using structured overlay networks
Authors: Timo Koskela, Otso Kassinen, Jari Korhonen, Zhonghong Ou, Mika Ylianttila
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In this paper, we present a system for the distributed management of user communities. The system utilizes multiple DHT overlay networks where nodes communicate in a peer-to-peer manner. Our system works on top of a P2PSIP protocol implementation that carries out the DHT signaling. The key idea behind our system is to use one overlay network per community; this results in multiple small overlays that are subsets of the main overlay. We evaluate how the usage of small community-overlays affects the nodes' load, as opposed to doing all activities in the main overlay. We also evaluate how the maintenance of community-overlays affects the nodes' load. Finally, we observe the tradeoff between these two quantities; while multiple small overlays decrease DHT-related network traffic in community activities, the management of multiple overlays also introduces some additional load to the nodes.
Some Unusual Experiments with PCA-Based Palmprint and Face Recognition
Authors: Ivan Krevatin, Slobodan Ribarić
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

In this paper we describe a number of experiments relating to PCA-based palmprint and face recognition. The experiments were designed to determine the influence of different training sets used for the construction of the eigenpalm and eigenface spaces on the recognition efficiency of biometric systems. The results of the recognition experiments, obtained using three palmprint databases (PolyU, FER1, FER2) and one face database (XM2VTSDB), suggest that it is possible to design a biometric recognition system that is robust enough to successfully recognize palmprints (or faces) even in cases when the eigenspaces are constructed from completely independent sets of palmprints or face images. Furthermore, the experiments show that for PCA-based face-recogni-tion systems with an eigenspace that is constructed by using palmprint-image databases, and PCA-based palmprint-recognition systems with an eigenspace that is constructed using a face-image database, the recognition rates are unexpectedly improved compared to the classic approach.
Improving the Performance of Text Categorization Using Automatic Summarization
Authors: Xiao-yu Jiang, Xiao-Zhong Fan, Zhi-Fei Wang, Ke-Liang Jia
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

In order to reduce the dimensionality of feature vector space and reduce the computing complexity of categorization, each document of the train set is summarized automatically and two approaches to text categorization based on these summaries are proposed: in the first approach, the text summarization is directly used for feature selection and categorization instead of the original text; in the second approach, each summary is used to select and weight features for each document, and free texts are classified using KNN algorithm. Experimental results show that the two proposed methods using automatic summarization can not only reduce the time of classifier training, but also improve the performance of text categorization.
Importance sampled circuit learning ensembles for robust analog IC design
Authors: Peng Gao, Trent McConaghy, Georges Gielen
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper presents ISCLEs, a novel and robust analog design method that promises to scale with Moore's Law, by doing boosting-style importance sampling on digital-sized circuits to achieve the target analog behavior. ISCLEs consists of: (1) a boosting algorithm developed specifically for circuit assembly; (2) an ISCLEs-specific library of possible digital-sized circuit blocks; and (3) a recently-developed multi-topology sizing technique to automatically determine each block's topology and device sizes. ISCLEs is demonstrated on design of a sinusoidal function generator and a flash A/D converter, showing promise to robustly scale with shrinking process geometries.