ppxscal/embedding_network huggingface dataset:
Modeling and Analysis of Mobility in MANeTs for Distributed Applications
Authors: Sapan Shah, R. B. Lenin, S. Ramaswamy, Sanjay Srivastava
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

Peer-to-Peer (P2P) networks have been used efficiently as building blocks for large-scale distributed network applications in wired networks. On the other hand, with large Mobile Ad Hoc Networks (MANeTs) becoming even more realistic, it is pertinent to build those distributed network applications in MANeTs as well. In this paper, we provide analytical results for performance measures of these underlying MANeTs using finite buffer open queuing networks (FBOQNs) with gated queuing nodes, intermittent links and servers. The results are verified by simulation.
Data Management: Databases & Organizations, 5th edition
Authors: Richard T. Watson
Venue:  (2007)

Now in a completely updated and revised sixth edition, this highly readable book emphasizes the core data management skills needed to succeed in today's business environment. The book presents a real-world, management perspective and offers fully integrated coverage of data modeling and SQL.
On tight projective designs
Authors: Yu. I. Lyubich
Venue: Designs, Codes and Cryptography (2009)

It is shown that among all tight designs in $${\mathbb {FP}^n \neq \mathbb {RP}^1}$$ , where $${\mathbb {F}}$$ is $${\mathbb {R}}$$ or $${\mathbb {C}}$$ , or $${\mathbb {H}}$$ (quaternions), only 5-designs in $${\mathbb {CP}^1}$$ (Lyubich, Shatalora Geom Dedicata 86: 169---178, 2001) have irrational angle set. This is the only case of equal ranks of the first and the last irreducible idempotent in the corresponding Bose-Mesner algebra.
GRASS3, a language for interactive graphics
Authors: Nola Donato
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

With the advance of technology, graphics devices are becoming more powerful and less expensive, making interactive graphics increasingly popular as a method of man-machine communication. Often nonprogrammers play a principal role in the design and implementation of graphics applications. Interactive graphics requires a high level of feedback both with the user and with the hardware. For these reasons, conventional programming languages are not well suited for such applications. This paper describes GRASS3, an interpretive language designed as a base for interactive graphics systems. The work derives from the author's thesis at the University of Illinois at Chicago Circle (UICC) and similar work done by the author for the Bally Manufacturing Corp. Design rationale for the language is given, followed by an overview including examples and a description of a specific real-time graphics system based on GRASS3.
Decreasing path algorithm for minimum flows: dynamic tree implementations
Authors: Oana Georgescu, Eleonor Ciurea
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

We present an algorithm for finding minimum flow in networks with arcs capacities using the dynamic tree implementation. As a final part, we present an example for this algorithm.
Affine-Transformation-Invariant Public Fragile Watermarking for 3D Model Authentication
Authors: Chang-Min Chou, Din-Chang Tseng
Venue: IEEE Computer Graphics and Applications (2009)

We propose a transformation invariant public fragile watermarking scheme for 3D model authentication. The proposed scheme embeds watermarks in a subset a model's faces to keep them in a predefined relationship with neighboring vertices so that any changes will ruin the relationship between the mark faces and neighboring vertices. The proposed scheme has the following advantages: It is invariant to translation, rotation, and uniform scaling operations. These operations do not change the integrity of the original model and should not be regarded as malicious attacks. The proposed method is public— the receiver does not need the original model and watermarks for authentication. It can locate changed regions. Distortion caused by the watermark embedding is controlled by the key settings according to the users' precision requirement. Experimental results show the scheme's effectiveness.
Raster-to-Vector Conversion: Problems and Tools Towards a Solution A Map Segmentation Application
Authors: Vinciane Lacroix
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

After the analysis of the problems a raster-to-vector (R2V) software can meet, a strategy involving a pre-processing, a clustering, a labeling and finally a vectorization phase is proposed. Much emphasis is put on the clustering and the labeling phases which depend on the pixel type (edge, line, or other). In particular, it is suggested to use the median-shift on all the pixels but the edgels to extract the main colors. Results are shown on scanned maps.
The Explore of Some Cases with the Data Mining Techniques
Authors: Shen-Ming Gu, Yun Zheng, Lin-Ting Guan, Yue-Ting Zhuang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

With the development of the computer technology a larger of data is generated and stored and many companies become ‘data rich and information poor’. This paper describes how BT has used data mining techniques to convert volume data into high-value information which can be used to aid decision making in a number of key business processes. The benefit of actively using data, as opposed to passively storing it, is demonstrated via a number of case studies which cover areas as diverse as fault diagnosis, fraud detection, market segmentation, credit vetting and litigation assessment.
SAMM: An Integrated Environment to Support Multimedia Synchronization of Pre-Orchestrated Data
Authors: Ronaldo Mussauer de Lima, Flavio Paiva Junqueira, Paulo Andre da S. Goncalves, Otto Carlos Muniz B. Duarte
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents the development of the SAMM integrated environment (Multimedia Presentation System), which has been proposed to support synchronized real-time communication and presentation of pre-orchestrated multimedia data. The employed multimedia synchronization technique was based on the eXtended model of the Object Composition Petri-Net (XOCPN). The integrated environment is presented by the description of its main components: the multimedia synchronization service; the modules that automatize processes concerning the synchronization mechanism; and the Composition graphical application that works as a specialized authoring tool and helps users that want to compose multimedia presentations.
Mobile exergaming
Authors: Carlos Garcia Wylie, Paul Coulton
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

With many industrialized societies bearing the cost of an increasingly sedentary on the health of their populations there is a need to find new ways of encouraging physical activities to promote better health and well being. Exergaming is a term used to describe video games that also provide exercise as part of the experience and is thus a possible means of encouragement, particularly for an audience that may be reluctant to undertake more conventional forms of exercise. With the increasing power of mobile phones and the recent emergence of personal heart rate monitors, aimed at dedicated amateur runners, there is now a possibility of enabling Mobile Exergaming incorporating realtime physiological data along with other general fitness applications designed to promote well being. In this paper we present a novel heart rate and movement controlled Mobile Exergame inspired by the old arcade classic Space Invaders which we have termed Health Defender which forms part of a general health monitoring software for mobile phones called Heart Angel. Player experience shows the potential for mobile exergaming and that as the technology becomes more prevalent is a real possibility for improving health and well being.
A linear quality control design for high efficient wavelet-based ECG data compression
Authors: King-Chu Hung, Chin-Feng Tsai, Cheng-Tung Ku, Huan-Sheng Wang
Venue: Computer Methods and Programs in Biomedicine (2009)

In ECG data compression, maintaining reconstructed signal with desired quality is crucial for clinical application. In this paper, a linear quality control design based on the reversible round-off non-recursive discrete periodized wavelet transform (RRO-NRDPWT) is proposed for high efficient ECG data compression. With the advantages of error propagation resistance and octave coefficient normalization, RRO-NRDPWT enables the non-linear quantization control to obtain an approximately linear distortion by using a single control variable. Based on the linear programming, a linear quantization scale prediction model is presented for the quality control of reconstructed ECG signal. Following the use of the MIT-BIH arrhythmia database, the experimental results show that the proposed system, with lower computational complexity, can obtain much better quality control performance than that of other wavelet-based systems.
Gesture and Gaze in Persuasive Political Discourse
Authors: Laura Vincze
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

Persuasion in political discourse is a very popular topic, which raised a lot of debate among researchers. Yet, not so much literature has been devoted to the persuasive impact of facial expression and gaze in persuasion. This paper is an introduction to further research and gives some examples of persuasive gesture and gaze, by trying to prove how important these aspects of communication may be in persuasive political discourse. Also, the focus of the paper is to show how politicians make use of them in order to express positive or negative evaluations about the opponent and thus, raise emotions in the public.
A framework for simulating industrial construction processes
Authors: Naimeh Sadeghi, Aminah Robinson Fayek
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In an industrial fabrication shop, such as pipe spool and steel fabrication, a product usually travels in the systems in the form of raw materials or components of the product. During the fabrication process, different components are assembled together to fabricate the final product. In this paper, to increase the accuracy of modeling fabrication processes, we propose a platform that can automatically model the raw materials and the assembly process of components of a product based on the unique features of a product. For this purpose, a Special Purpose Simulation (SPS) template for industrial fabrication is developed. The platform is used to develop a simulation based decision support system using a real case study of a pipe spool fabrication shop.
Coefficient Compensation Method for Embedded Codec
Authors: Sheng-kui Dai, Jian-guo Liu, Xiu-li Tang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A simple coefficient compensation method is proposed for the discarded low-bit coefficient in embedded decoding system. First, the coefficient matrix of image is extended as a "general" image. Then some traditional conceptions and quantitative index of image's quality in spatial domain can be borrowed to evaluate the coefficient matrix in transform domain. By defining a special evaluation rule for the coefficient matrix, a simple method is deduced to compensate the coefficients before inverse transformation operation. Experiments indicated its effect to enhance the quality of decoded image. This method can also be used in other codec based on bit-plane scanning.
A generalization of Lucas polynomial sequence
Authors: Gi-Sang Cheon, Hana Kim, Louis W. Shapiro
Venue: Discrete Applied Mathematics (2009)

In this paper, we obtain a generalized Lucas polynomial sequence from the lattice paths for the Delannoy numbers by allowing weights on the steps (1,0),(0,1) and (1,1). These weighted lattice paths lead us to a combinatorial interpretation for such a Lucas polynomial sequence. The concept of Riordan arrays is extensively used throughout this paper.
Private multiparty sampling and approximation of vector combinations
Authors: Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
Venue: Theoretical Computer Science (2009)

We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties want to investigate the componentwise combination of their vectors. The parties want to minimize communication and local computation while guaranteeing privacy in the sense that no party learns more than necessary. Sublinear-communication private protocols have primarily been studied only in the two-party case. In contrast, this work focuses on multi-party settings. First, we give efficient private multiparty protocols for sampling a row of the data matrix and for computing arbitrary functions of a random row, where the row index is additively shared among two or more parties. These results can be used to obtain private approximation protocols for several useful combination functionalities. Moreover, these results have some interesting consequences for the general problem of reducing sublinear-communication secure multiparty computation to two-party private information retrieval (PIR). Second, we give protocols for computing approximations (summaries) of the componentwise sum, minimum, and maximum of the columns. Here, while providing a weaker privacy guarantee (where the approximation may leak up to the entire output vector), our protocols are extremely efficient. In particular, the required cryptographic overhead (compared to non-private solutions) is polylogarithmic in the number of rows.
Compensated Visual Hull with GPU-Based Optimization
Authors: Hansung Kim, Ryuuki Sakamoto, Itaru Kitahara, Tomoji Toriyama, Kiyoshi Kogure
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

We propose an advanced visual hull technique to compensate for outliers using the reliabilities of silhouettes. The proposed method consists of a foreground extraction technique with multiple thresholds based on the Generalized Gaussian Family model and a compensated visual hull algorithm. We proved that the proposed technique constructs a compact visual hull even in the presence of segmentation errors and occlusions. The 3D reconstruction and rendering processes are implemented on a graphics processing unit to greatly accelerate computation time.
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
Authors: Rachid Hadid, Mehmet Hakan Karaata
Venue: Computer Communications (2009)

In this paper, we present an adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Given two distinct nodes s and t of a network, the all disjoint paths problem is to identify all disjoint paths from s to t. Since our algorithm is stabilizing, it does not require initialization and withstands transient faults. In addition, the proposed algorithm adapts to topology changes in the form of process/link crashes and additions, i.e., upon a topology change, it finds all available paths from s to t. The space complexity of our algorithm is 4xd states for the source process s, one state for the target process, 120xd states for other processes, where d is the diameter of the communication network. The time complexity of the proposed algorithm is O(d) rounds. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.
Women in computer science: past, present and future challenges
Authors: Ann Moskol, Lea Bernard, Suzanne Ronayne, Namita Sarawagi, Sara Czyzewicz
Venue: Journal of Computing Sciences in Colleges (2009)

Enrollment of women in Computer Science has been declining over the past decade. This is an issue of grave concern and consequences. This all female panel from Rhode Island College, which consists of two faculty members, two current students, and one alumna, will present different perspectives on the challenges that women face in computer science. The panelists will share their personal experiences from the past, their observations of women who are currently in computer science, and possible ways to improve the future of women in this field. Some of the topics addressed will be: why so few women are currently choosing CS as a major; what types of CS jobs may be more interesting to women, and possible strategies to increase female enrollment in the major.
A new look at computer contracts
Authors: Dennis K. Knight
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Standard form contracts for computer sales and licenses are typically drafted primarily to protect vendors by limiting their legal liability. These contracts do not usually play a constructive role in the management of a computer project. Three factors cast doubt on the enforceability of the vendor-protective provisions of these contracts: (a) two recent court decisions refusing to enforce these protective provisions, (b) the application of consumer protection laws to certain computer transactions, and (c) the proliferation of business computer systems among unsophisticated users. This paper discusses these factors and proposes as an alternative to these standard form contracts a type of contract patterned after system development methodology and designed to educate the customer, provide a management guide for successful computer system acquisition, and reduce the risk of a court's refusing to enforce the contract. 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
Graph kernels based on tree patterns for molecules
Authors: Pierre Mahé, Jean-Philippe Vert
Venue: Machine Learning (2009)

Motivated by chemical applications, we revisit and extend a family of positive definite kernels for graphs based on the detection of common subtrees, initially proposed by Ramon and Gärtner (Proceedings of the first international workshop on mining graphs, trees and sequences, pp. 65---74, 2003). We propose new kernels with a parameter to control the complexity of the subtrees used as features to represent the graphs. This parameter allows to smoothly interpolate between classical graph kernels based on the count of common walks, on the one hand, and kernels that emphasize the detection of large common subtrees, on the other hand. We also propose two modular extensions to this formulation. The first extension increases the number of subtrees that define the feature space, and the second one removes noisy features from the graph representations. We validate experimentally these new kernels on problems of toxicity and anti-cancer activity prediction for small molecules with support vector machines.
Efficient implementation of the MFS: The three scenarios
Authors: Yiorgos-Sokratis Smyrlis, Andreas Karageorghis
Venue: Journal of Computational and Applied Mathematics (2009)

In this study we investigate the approximation of the solutions of harmonic problems subject to Dirichlet boundary conditions by the Method of Fundamental Solutions (MFS). In particular, we study the application of the MFS to Dirichlet problems in a disk. The MFS discretization yields systems which possess special features which can be exploited by using Fast Fourier transform (FFT)-based techniques. We describe three possible formulations related to the ratio of boundary points to sources, namely, when the number of boundary points is equal, larger and smaller than the number of sources. We also present some numerical experiments and provide an efficient MATLAB implementation of the resulting algorithms.
Universities and the future of high-performance computing technology
Authors: Kenneth G. Wilson
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Universities have four main roles in the growth of computer technology. (1) Universities provide trained personnel for both the computing industry and industrial users of computing. (2) Universities carry out the majority of very advanced software research and prototype development. (3) Universities can provide an advance market for new computing hardware and can help manufacturers refine innovative products to serve commercial markets. (4) Universities carry out basic research needed to support continued technological growth. There are extraordinary developments taking place in computing that it is difficult for U.S. industry to absorb without the universities' help. Present university support is grossly inadequate for any of these functions. I propose a computer tax as a model of how universities should be supported. It would provide the hundreds of millions of dollars needed to restore the universities' role in computing-technology growth. More importantly, it would ensure that universities' future growth in technological areas is at the same rate as that of computing technology itself.
General Composition and Universal Composability in&#x00a0;Secure Multiparty Computation
Authors: Yehuda Lindell
Venue: Journal of Cryptology (2009)

Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting is what is desired, or even needed, in modern computer networks where many different protocols are executed concurrently. Canetti (FOCS 2001) introduced the notion of universal composability and showed that security under this definition is sufficient for achieving concurrent general composition. However, it is not known whether or not the opposite direction also holds. Our main result is a proof that security under concurrent general composition, when interpreted in the natural way under the simulation paradigm, is equivalent to a variant of universal composability, where the only difference relates to the order of quantifiers in the definition. (In newer versions of universal composability, these variants are equivalent.) An important corollary of this theorem is that existing impossibility results for universal composability (for all its variants) are inherent for definitions that imply security under concurrent general composition, as formulated here. In particular, there are large classes of two-party functionalities for which it is impossible to obtain protocols (in the plain model) that remain secure under concurrent general composition. We stress that the impossibility results obtained are not &#x201c;black-box,&#x201d; and apply even to non-black-box simulation. Our main result also demonstrates that the definition of universal composability is somewhat &#x201c;minimal&#x201d; in that the composition guarantee provided by universal composability implies the definition itself. This indicates that the security definition of universal composability is not overly restrictive.