ppxscal/embedding_network huggingface dataset:
PEPINO: PEer-to-Peer network INspectOr
Authors: Donatien Grolaux, Boris Mejias, Peter Van Roy
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

PEPINO is a simple and effective peer-to-peer network inspector. It visualises not only meaningful pointers and connections between peers, but also the exchange of messages between them, providing a useful tool for debugging purposes. It can monitor running networks, simulate them and log them in order to reproduce interesting case scenarios. Failures can be explicitly introduced to study fault tolerant algorithms. The graphical representation of the network uses a physical model to attract or repel peers, allowing the user to study the system from different points of view. This demo aims to present the use of PEPINO in the development of a novel relaxed-ring topology for fault tolerant networks, where the representation of the ring based on predecessors may differ from the ring based on successors. We show how PEPINO is also useful for visualising other network topologies such as perfect ring or unstructured networks.
Extracting Rules of Initial Returns Using Attribute Selection and Entropy-Based Rough Sets in Electronic Firm
Authors: Ching-Hsue Cheng, You-Shyang Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper briefly forecasts initial returns in initial public offerings (IPOs) market of Taiwan stock trading systems by attribute selection and entropy-based rough set. It is very important for investors that correctly predict initial returns from trading systems because of the more accurate prediction, the more gain profit. In this paper, we use attribute selecting based method to enhance accuracy of classifier, and use entropy based method to discretize attributes for enhancing rough set classifier. The practical IPOs dataset is employed in this case study to illustrate the proposed approach. From the results, the proposed approach has three advantages: (1) improves accuracy, (2) reduces attributes and (3) generates fewer rules. Furthermore, the performance is superior to the listing methods.
Real-Time Microcomputer Applications Using LLL Basic
Authors: M. D. Maples
Venue: Computer (1977)

One of the most controversial subjects today is the cost-effectiveness and usefulness of high-level languages in microcomputer applications. Lawrence Livermore Laboratory has been involved with microprocessors since 19721,2and as such has constantly been involved with the evaluation of HLL's. The problem becomes even more complicated when the area of real time data acquisition and control is specifically addressed.
A novel synthesis algorithm for reversible circuits
Authors: Mehdi Saeedi, Mehdi Sedighi, Morteza Saheb Zamani
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, a new non-search based synthesis algorithm for reversible circuits is proposed. Compared with the widely used search-based methods, our algorithm is guarantied to produce a result and can lead to a solution with much fewer steps. To evaluate the proposed method, several circuits taken from the literature are used. The experimental results corroborate the expected findings.
Integrated Design and Verification of Simulation Programs
Authors: R. Chattergy
Venue: Computer (1977)

One of the more critical problems in computing science today is the rapidly increasing cost of developing and maintaining software for new automated data systems. New software development is generally a standardized process whereby software evolves from an idea to a useful system operating on a computer. The traditional model for a software development project includes feasibility study, requirements analysis, system design, program design, coding, testing, documentation, and implementation. Program design, coding, and testing are relatively well defined activities, but they are rarely straightforward. Involving many iterations among the phases and the activities within the phases, these iterations are a result of the knowledge gained as the system is being generated. We will describe here a different approach to the software development process. This approach, called "top-down modular design," attempts to minimize the numerous iterations of the development cycle. The basic philosophy, similar to that of structured programming, has already been applied to a variety of applications but has not yet been utilized in the general process of constructing simulation programs.
Letters: Exploiting multi-scale support vector regression for image compression
Authors: Bin Li, Danian Zheng, Lifeng Sun, Shiqiang Yang
Venue: Neurocomputing (2007)

Unlike traditional neural networks that require predefined topology of the network, support vector regression (SVR) approach can model the data within the given level of accuracy with only a small subset of the training data, which are called support vectors (SVs). This property of sparsity has been exploited as the basis for image compression. In this paper, for still image compression, we propose a multi-scale support vector regression (MS-SVR) approach, which can model the images with steep variations and smooth variations very well resulting in good performance. We test our proposed MS-SVR based algorithm on some standard images. The experimental results verify that the proposed MS-SVR achieves better performance than standard SVR. And in a wide range of compression ratio, MS-SVR is very close to JPEG in terms of peak signal-to-noise ratio (PSNR) but exhibits better subjective quality. Furthermore, MS-SVR even outperforms JPEG on both PSNR and subjective quality when the compression ratio is higher enough, for example 25:1 for Lena image. Even when compared with JPEG-2000, the results show greatly similar trend as those in JPEG experiments, except that the compression ratio is a bit higher where our proposed MS-SVR will outperform JPEG-2000.
From here to human-level AI
Authors: John McCarthy
Venue: Artificial Intelligence (2007)

Human-level AI will be achieved, but new ideas are almost certainly needed, so a date cannot be reliably predicted-maybe five years, maybe five hundred years. I'd be inclined to bet on this 21st century. It is not surprising that human-level AI has proved difficult and progress has been slow-though there has been important progress. The slowness and the demand to exploit what has been discovered has led many to mistakenly redefine AI, sometimes in ways that preclude human-level AI-by relegating to humans parts of the task that human-level computer programs would have to do. In the terminology of this paper, it amounts to settling for a bounded informatic situation instead of the more general common sense informatic situation. Overcoming the ''brittleness'' of present AI systems and reaching human-level AI requires programs that deal with the common sense informatic situation-in which the phenomena to be taken into account in achieving a goal are not fixed in advance. We discuss reaching human-level AI, emphasizing logical AI and especially emphasizing representation problems of information and of reasoning. Ideas for reasoning in the common sense informatic situation include nonmonotonic reasoning, approximate concepts, formalized contexts and introspection.
Animated Transitions in Statistical Data Graphics
Authors: Jeffrey Heer, George Robertson
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

In this paper we investigate the effectiveness of animated transitions between common statistical data graphics such as bar charts, pie charts, and scatter plots. We extend theoretical models of data graphics to include such transitions, introducing a taxonomy of transition types. We then propose design principles for creating effective transitions and illustrate the application of these principles in DynaVis, a visualization system featuring animated data graphics. Two controlled experiments were conducted to assess the efficacy of various transition types, finding that animated transitions can significantly improve graphical perception.
Reusability Framework, Assessment, and Directions
Authors: T. Biggerstaff
Venue: IEEE Software (1987)

Reusability remains a puzzle despite its promise. Why? What can be done? The authors discuss some answers and possibilities.
A descriptive screenshot analysis in a mixed presence setting
Authors: Cara Stitzlein, Anja Wessels
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

In mixed presence settings (MPS) computer- mediated interactions of individuals and co-located groups, particular technical (video transmission of a large co-located group) and perceptual (ability to perceive video of remote people) challenges require attention. This paper presents results of a descriptive study within industry based on in vivo screen snapshots. The results illustrate how MPS are complicated by size of co-located groups. We present considerations for using video in these settings, informing engineers, evaluators and users of such potentially complex videoconferencing spaces.
On Segmentation of Documents in Complex Scripts
Authors: K. S. Kumar, S. Kumar, C. Jawahar
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Document image segmentation algorithms primarily aim at separating text and graphics in presence of complex lay- outs. However, for many non-Latin scripts, segmentation becomes a challenge due to the characteristics of the script. In this paper, we empirically demonstrate that successful al- gorithms for Latin scripts may not be very effective for Indic and complex scripts. We explain this based on the differ- ences in the spatial distribution of symbols in the scripts. We argue that the visual information used for segmenta- tion needs to be enhanced with other information like script models for accurate results.
Alpaca: extensible authorization for distributed services
Authors: Chris Lesniewski-Laas, Bryan Ford, Jacob Strauss, Robert Morris, M. Frans Kaashoek
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them with, and too many administrative domains with incompatible roots of trust. Alpaca is an authentication and authorization framework that embraces PKI diversity by enabling one PKI to "plug in" another PKI's credentials and cryptographic algorithms, allowing users of the latter to authenticate themselves to services using the former using their existing, unmodified certificates. Alpaca builds on Proof-Carrying Authorization (PCA), expressing a credential as an explicit proof of a logical claim. Alpaca generalizes PCA to express not only delegation policies but also the cryptographic primitives, credential formats, and namespace structures needed to use foreign credentials directly. To achieve this goal, Alpaca introduces a method of creating and naming new principals which behave according to arbitrary rules, a modular approach to logical axioms, and a domain-specific language specialized for reasoning about authentication. We have implemented Alpaca as a Python module that assists applications in generating proofs (e.g., in a client requesting access to a resource), and in verifying those proofs via a compact 800-line TCB (e.g., in a server providing that resource). We present examples demonstrating Alpaca's extensibility in scenarios involving inter-organization PKI interoperability and secure remote PKI upgrade.
Middleware for data mining applications on clusters and grids
Authors: Leonid Glimcher, Ruoming Jin, Gagan Agrawal
Venue: Journal of Parallel and Distributed Computing (2008)

This paper gives an overview of two middleware systems that have been developed over the last 6 years to address the challenges involved in developing parallel and distributed implementations of data mining algorithms. FREERIDE (FRamework for Rapid Implementation of Data mining Engines) focuses on data mining in a cluster environment. FREERIDE is based on the observation that parallel versions of several well-known data mining techniques share a relatively similar structure, and can be parallelized by dividing the data instances (or records or transactions) among the nodes. The computation on each node involves reading the data instances in an arbitrary order, processing each data instance, and performing a local reduction. The reduction involves only commutative and associative operations, which means the result is independent of the order in which the data instances are processed. After the local reduction on each node, a global reduction is performed. This similarity in the structure can be exploited by the middleware system to execute the data mining tasks efficiently in parallel, starting from a relatively high-level specification of the technique. To enable processing of data sets stored in remote data repositories, we have extended FREERIDE middleware into FREERIDE-G (FRamework for Rapid Implementation of Data mining Engines in Grid). FREERIDE-G supports a high-level interface for developing data mining and scientific data processing applications that involve data stored in remote repositories. The added functionality in FREERIDE-G aims at abstracting the details of remote data retrieval, movements, and caching from application developers.
Performance of Optical CDMA Systems with Low Density Parity Check Codes
Authors: S. Sahuguede, A. Julien-Vergonjanne, J. P. Cances
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Incoherent Optical Code Division Multiple Access (OCDMA) is a potential issue for future high speed optical networks. To reduce the number of errors at the detection due in particular to Multiple Access Interference (MAI), we add to the OCDMA link a block of efficient error correction codes named Low Density Parity Check codes (LDPC). The LDPC decoding algorithm, Belief Propagation (BP), usually employed to correct errors due to Gaussian noise, is reconsidered in order to take into account the MAI binomial distribution. The performance of an OCDMA link using 1 Dimensional and 2 Dimensional code sequences along with several LDPC codes is investigated. The performance is enhanced not only in an ideal case with only MAI, but also in a noisy case with MAI and thermal noise. With such error correction coding scheme, the constraints over OCDMA parameters and the signal to noise ratio are greatly relaxed.
Using Programmable On-Product Clock Generation (OPCG) for Delay Test
Authors: Brion Keller, Anis Uzzaman, Bibo Li, Tom Snethen
Venue: Proceedings of the 16th Asian Test Symposium (2007)

On-product clock generation (OPCG) has been used for many years, often in conjunction with Logic and Memory BIST, but it is a labor-intensive process to identify the cutpoints and the OPCG behavior so the ATPG tools can ignore the OPCG logic. Supporting programmable OPCG logic in an ASIC methodology flow required us to automate the OPCG test generation flow. This paper describes how we provide a means for dealing with the programmable aspects of OPCG for use during ATPG and show some results for a few real designs.
Application of Distributed Genetic Algorithm Based on Migration Strategy in Image Segmentation
Authors: Chang Yao, Houjin Chen, Jiangbo Yu, Jupeng Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The traditional 1 Dimension Maximum Between-class Variance (1DMBV) method cannot obtain ideal threshold if the image has low SNR, while 2DMBV method can perform well even on the image with low SNR and low contrast, but with large computation. Some researchers combined the Standard Genetic Algorithm with 2DMBV method (SGA-2DMBV), but it was premature and slowly convergent. In this paper, combined with 2DMBV, one Distributed Genetic Algorithm base on Migration Strategy (DGA-2DMBV) was introduced to search optimal threshold with considerations to restraining premature convergence and shortening running time. Simulation results show that the proposed method is better than SGA-2DMBV at global search ability and far more quickly than 2DMBV at running time.
Performance Analysis of Energy Detection for Cognitive RadioWireless Networks
Authors: Qingchun Ren, Qilian Liang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In this paper, considering hidden terminal and exposed node problems, we make a theoretical analysis on the performance of commonly used energy detection methods, such as ideal method, transmitter-independent method and transmitter/receiver-cooperated method, in terms of detection probability. Corresponding analytical models are provided. Performance theoretical curves are acquired to compare the characteristics for individual energy detection methods under various scenarios. Moreover the upper bound for detection probability is achieved and is compared under various system traffic intensity and sensing capability.
Shine: search heterogeneous interrelated entities
Authors: Xuanhui Wang, Jian-Tao Sun, Zheng Chen
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Heterogeneous entities or objects are very common and are usually interrelated with each other in many scenarios. For example, typical Web search activities involve multiple types of interrelated entities such as end users, Web pages, and search queries. In this paper, we define and study a novel problem: <UL>S</UL>earch <UL>H</UL>eterogeneous <UL>IN</UL>terrelated <UL>E</UL>ntities (SHINE). Given a SHINE-query which can be any type(s) of entities, the task of SHINE is to retrieve multiple types of related entities to answer this query. This is in contrast to the traditional search,which only deals with a single type of entities (e.g., Web pages). The advantages of SHINE include: (1) It is feasible for end users to specify their information need along different dimensions by accepting queries with different types. (2) Answering a query by multiple types of entities provides informative context for users to better understand the search results and facilitate their information exploration. (3) Multiple relations among heterogeneous entities can be utilized to improve the ranking of any particular type of entities. To attain the goal of SHINE, we propose to represent all entities in a unified space through utilizing their interaction relationships. Two approaches, M-LSA and E-VSM, are discussed and compared in this paper. The experiments on 3 data sets (i.e., a literature data set, a search engine log data set, and a recommendation data set) show the effectiveness and flexibility of our proposed methods.
Towards 3-query locally decodable codes of subexponential length
Authors: Sergey Yekhanin
Venue: Journal of the ACM (JACM) (2008)

A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only q bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. We give new constructions of three query LDCs of vastly shorter length than that of previous constructions. Specifically, given any Mersenne prime p &equals; 2t &minus; 1, we design three query LDCs of length N &equals; exp(O(n1/t)), for every n. Based on the largest known Mersenne prime, this translates to a length of less than exp(O(n10 &minus; 7)) compared to exp(O(n1/2)) in the previous constructions. It has often been conjectured that there are infinitely many Mersenne primes. Under this conjecture, our constructions yield three query locally decodable codes of length N &equals; exp(nO(1/log log n)) for infinitely many n. We also obtain analogous improvements for Private Information Retrieval (PIR) schemes. We give 3-server PIR schemes with communication complexity of O(n10 &minus; 7) to access an n-bit database, compared to the previous best scheme with complexity O(n1/5.25). Assuming again that there are infinitely many Mersenne primes, we get 3-server PIR schemes of communication complexity nO(1/log logn)) for infinitely many n. Previous families of LDCs and PIR schemes were based on the properties of low-degree multivariate polynomials over finite fields. Our constructions are completely different and are obtained by constructing a large number of vectors in a small dimensional vector space whose inner products are restricted to lie in an algebraically nice set.
On the specification of learning objectives for course configuration
Authors: George Fernandez, Andrea Sterbini, Marco Temperini
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper we present a method for the formal specification of learning objectives, which is intended to enable their management and use in the automated construction of personalized courses. Such a specification is also intended to be sufficiently simple and flexible to allow for the (non automatic) specification of learning objectives starting from their textual ("verbose") definition. We firstly define a set of learning objective "templates" by which the cognitive levels defined in the Model Curriculum and Guidelines [8] can be rendered. Then we sample the use of such templates in the expression of several learning objectives, whose textual definition is taken from an introductory unit on programming described in the Computing Curricula [4]. This method of specification of learning objectives is used to extend a framework for course configuration coming from our previous work. In the resulting framework, the learning material is made by a set of learning components, whose metadata specification is based on the use of learning objectives. Given starting learner's knowledge and target knowledge (specified by learning objectives as well) a personalized course can be configured by automatically selecting and sequencing needed learning components. A Prolog implementation under development is discussed.
3D Shape Retrieval Integrated with Classification Information
Authors: Dong Xu, Hua Li
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

3D surface moment invariants are a kind of integral invariants under translation, uniform scaling and rotation, and can be regarded as shape descriptors of 3D unclosed polygonal models. Few of the former literature used prior knowledge from the training set for supervised learning. In this paper, we illustrate how to select the training data and how to feed the feature vectors of the training models to backpropagation neural network for learning. Experimental result shows that the test models are sorted into the correct classes with high accuracy, including two-class classification and multi-class classification. Furthermore, we develop a novel method which uses weighted Manhattan distance to embed classification information into the traditional shape retrieval systems properly. It could determine and refine the retrieval results efficiently.
A Secure Storage Service for the gLite Middleware
Authors: Diego Scardaci, Giordano Scuderi
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

The Secure Storage service for the gLite middleware provides users with a set of tools to store in a secure way and in an encrypted format confidential data (e.g. medical or financial data) on the grid storage elements. The data stored though provided tools will be accessible and readable by authorized users only. Moreover, it solves the insider abuse problem preventing also the administrators of the storage elements to access the confidential data in a clear format. The service has been designed and developed for the grid middleware of the EGEE Project, gLite, in the context of the TriGrid VL Project.