ppxscal/embedding_network huggingface dataset:
TIMELINESWikipedia: the happy accident
Authors: Joseph Reagle
Venue: interactions (2009)

Joseph Reagle's work on Wikipedia and its predecessors opened my eyes to a fascinating history. I'm delighted he has provided this account of the origin of the most interesting digital object since the Web itself. ---Jonathan Grudin
Forward-Secure Multi-signatures
Authors: N. R. Sunitha, B. B. Amberker
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

In many applications a document needs to be signed by more than one signer. When a signature depends on more than one signer we call it a multi-signature. Further, ordinary digital signatures have an inherent weakness: if the secret key is leaked, then all signatures, even the ones generated before the leak, are no longer trustworthy. Forward-secure digital signatures were proposed to address this weakness, they ensure that the past signatures remain secure even if the current secret key is leaked. We propose to apply the concept of Forward-Security to multi-signatures. The basic signature scheme that we have considered is ElGamal Signature scheme which is based on discrete log problem. We initially make this signature scheme forward-secure and then apply it to multi-signatures. By this all signers of the document can guarantee the security of document signed in the past even if their secret key is exposed today. An adversary will not be able to forge a multi-signature unless the secret key of all the signers are compromised in the same time period, which is practically not possible. Further, we propose two types of Forward-Secure multi-signatures : Forward-Secure Parallel multi-signatures and Forward-Secure Serial multi-signatures.Once a user switches to use forward-secure signatures in place of ordinary signatures, he can easily extend it to use it as a multi-signature. In all applications where parallel or serial multi-signatures are used, the corresponding forward-secure multi-signatures can be used.
Teaching XML data type definition: a visual method
Authors: Hsiang-Jui Kung, Hui-Lien Tung
Venue: Journal of Computing Sciences in Colleges (2009)

XML is the standard for data exchange on the Internet. Database researchers have been investigating XML as a database wrapper and mediation medium, using XML to describe Web resources, storing and indexing XML in traditional database systems, understanding the interaction of data type definitions (DTDs) with constraint and typing mechanisms, and designing query languages for XML. Literature has found that approximately half of the XML documents available on the Web do not refer to a schema. In this paper, we describe a visual method to convert XML document to valid DTD schema with accuracy, conciseness and speed.
A new feature-preserving mesh-smoothing algorithm
Authors: Zhong Li, Lizhuang Ma, Xiaogang Jin, Zuoyong Zheng
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

We present a novel mesh denoising and smoothing method in this paper. Our approach starts by estimating the principal curvatures and mesh saliency value for each vertex. Then, we calculate the uniform principal curvature of each vertex based on the weighted average of local principal curvatures. After that, we use the weighted bi-quadratic B&#x00e9;zier surface to fit the neighborhood of each vertex using the least-square method and obtain the new vertex position by adjusting the parameters of the fitting surface. Experiments show that our smoothing method preserves the geometric feature of the original mesh model efficiently. Our approach also prevents the volume shrinkage of the input mesh and obtains smooth boundaries for non-closed mesh models.
Secure Software Engineering: Learning from the Past to Address Future Challenges
Authors: Daniel Hein, Hossein Saiedian
Venue: Information Security Journal: A Global Perspective (2009)

This paper provides a taxonomy of secure software systems engineering (SSE) by surveying and organizing relevant SSE research and presents current trends in SSE, on-going challenges, and models for reasoning about threats and vulnerabilities. Several challenging questions related to risk assessment/mitigation (e.g., “what is the likelihood of attack”) as well as practical questions (e.g., “where do vulnerabilities originate” and “how can vulnerabilities be prevented”) are addressed.
Voice Technology Applied for Building a Prototype Smart Room
Authors: Josef Chaloupka, Jan Nouza, Jindrich Zdansky, Petr Cerva, Jan Silovsky, Martin Kroul
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)

This contribution is about a system called VoiCenter that allows motor-handicapped people to control PC and standard electric and electronics devices (lights, heating, climate control, electric blinds, TV, radio, DVD, HI-FI etc.) in their homes. The PC and the devices are possible to be controlled with the help of simple voice commands. The wireless connection between PC and the devices was used in this system. This is good for fast installation of this complex system in homes. We have used our own speech recognition and control computer system that is described in this paper too.
Report of the 2008 SIGPLAN programming languages curriculum workshop: preliminary report
Authors: Mark Bailey, Kim Bruce, Kathleen Fisher, Robert Harper, Stuart Reges
Venue: ACM SIGCSE Bulletin (2009)

This special session will present a summary of the recommendations of the First SIGPLAN Workshop on Undergraduate Programming Language Curricula, held at Harvard University in May, 2008. The purpose of the workshop was to generate new recommendations for programming languages topics to be learned by all undergraduate CS majors. In this special session we will present a summary of the curriculum recommendations, why they were made, and ways of incorporating them into undergraduate CS curricula.
CUPS Administrative Guide: A practical tutorial to installing, managing, and securing this powerful printing system
Authors: Ankur Shah
Venue:  (2008)

If you want to get started and keep your printers on *NIX-like servers in a perfect shape, this book is for you. This book is for Linux/Unix System Administrators interested in designing and setting up a CUPS network and provides enough knowledge to understand how the technology works, make decisions about deployment, and then implement a stable work environment. No knowledge in CUPS is required but readers need to be comfortable with working in the Linux/Unix environment. On the whole, readers should have basic knowledge of the Linux environment.
Agents&#x2019; model of uncertainty
Authors: Germano Resconi, Boris Kovalerchuk
Venue: Knowledge and Information Systems (2009)

Multi-agent systems play an increasing role in sensor networks, software engineering, web design, e-commerce, robotics, and many others areas. Uncertainty is a fundamental property of these areas. Agent-based systems use probabilistic and other uncertainty models developed earlier without explicit consideration of agents. This paper explores the impact of agents on uncertainty models and theories. We compare two methods of introducing agents to uncertainty theories and propose a new theory called the agent-based uncertainty theory (AUT). We show advantages of AUT for advancing multi-agent systems and for solving an internal fundamental question of uncertainty theories, that is identifying coherent approaches to uncertainty. The advantages of AUT are that it provides a uniform agent-based representation and an operational empirical interpretation for several uncertainty theories such as rough set theory, fuzzy sets theory, evidence theory, and probability theory. We show also that the introduction of agents to intuitionist uncertainty formalisms can reduce their conceptual complexity. To build such uniformity the AUT exploits the fact that agents as independent entities can give conflicting evaluations of the same attribute. The AUT is based on complex aggregations of crisp (non-fuzzy) conflicting judgments of agents. The generality of AUT is derived from the logical classification of types (orders) of conflicts in the agent populations. At the first order of conflict, the two agent populations are disjoint and there is no interference of logic values assigned to any statement p and its negation by agents. The second order of conflict models superposition (interference) of logic values for overlapping agent populations where an agent assigns conflicting logic values (true, false) to the same attribute simultaneously.
Web Page Rank Prediction with PCA and EM Clustering
Authors: Polyxeni Zacharouli, Michalis Titsias, Michalis Vazirgiannis
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

In this paper we describe learning algorithms for Web page rank prediction. We consider linear regression models and combinations of regression with probabilistic clustering and Principal Components Analysis (PCA). These models are learned from time-series data sets and can predict the ranking of a set of Web pages in some future time. The first algorithm uses separate linear regression models. This is further extended by applying probabilistic clustering based on the EM algorithm. Clustering allows for the Web pages to be grouped together by fitting a mixture of regression models. A different method combines linear regression with PCA so as dependencies between different web pages can be exploited. All the methods are evaluated using real data sets obtained from Internet Archive, Wikipedia and Yahoo! ranking lists. We also study the temporal robustness of the prediction framework. Overall the system constitutes a set of tools for high accuracy pagerank prediction which can be used for efficient resource management by search engines.
An interactive method for generalized association rule mining using FP-tree
Authors: Manisha Agarwal, Manisha Jailia
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

Generalized association rule mining plays a very important role in Knowledge discovery in Databases (KDD). Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules. In this paper, we describe a formal method for the problem of mining generalized association rules. In proposed method, The subset-superset and the parent-child relationships among generalized itemsets are introduced to present the different views of generalized itemsets, i.e. concept hierarchy. There are two phases in our proposed work; phases are "Level Defragmentation" and "Branch Defragmentation". Input of our algorithm is a conceptual hierarchy and a FP-tree. Using our proposed approaches, one can transform a lower level FP-tree to a Higher level FP-tree. Through higher level FP-tree we generate generalized association rule.
Criteria for a standard command language based on data abstraction
Authors: David Beech
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A solution is offered to some fundamental problems that have thwarted previous efforts to develop a standard command language. The technical approach is based on the form of modularity provided by data abstraction, and this is introduced from the point of view of the end user, together with a discussion of the advantages and disadvantages that might be perceived at this level. This leads to the statement of a simple but stringent set of criteria for the inclusion of functional capabilities in a standard command language and the testing of various candidates against them. Some candidates are accepted and others rejected, resulting in an initial proposal for the scope of a standard command language that is small and simple enough to have a hope of success.
Acute and nonobtuse triangulations of polyhedral surfaces
Authors: Shubhangi Saraf
Venue: European Journal of Combinatorics (2009)

In this paper, we prove the existence of acute triangulations for general polyhedral surfaces. We also show how to obtain nonobtuse subtriangulations of triangulated polyhedral surfaces.
Space-time code selection for OFDM-MISO systems
Authors: D. Mavares Terán, Rafael P. Torres
Venue: Computer Communications (2009)

In this paper, a space-time code selection technique for multiple transmit antenna OFDM systems is proposed, and a constant-rate transmission mode for the space-time code selection technique is introduced. Subcarriers are divided into subcarrier groups and a comparison of the equivalent SISO channel envelopes with a set of predetermined threshold levels for a central subcarrier of each group is performed at the receiver, which decides on the subcarriers to be used at each antenna and sends this information to the transmitter. The transmitter adjusts the space-time code to the number of selected antennas at each subcarriers group using four bits for feedback information per group. Simulation results show that the system performs well for a range of Doppler frequencies for correlated and uncorrelated channels, outperforming transmit antenna selection techniques and adaptive transmit antenna diversity systems for both variable-rate and constant-rate transmission modes.
A Zero-Knowledge Identity Verification Protocol Using Blind Watermark
Authors: Junhua Chen, Wu Peng
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Combining the identification characteristics of zero-knowledge proof and blind watermark, an identity verification protocol is proposed. In this protocol, the public key encryption is used to encrypt the watermark and the watermarked data of the watermark embedding locations, and the verification of user's identity watermarking is achieved through estimating the relativity of them. Furthermore, a way which restricts the prover and verifier’s communication to a closed situation is put forward, and this way can resist such as brute force cheat-attack.
Inducing regulation of any digraphs
Authors: Joanna Górska, Zdzisław Skupień
Venue: Discrete Applied Mathematics (2009)

For a given structure D (digraph, multidigraph, or pseudodigraph) and an integer r large enough, a smallest inducing r-regularization of D is constructed. This regularization is an r-regular superstructure of the smallest possible order with bounded arc multiplicity, and containing D as an induced substructure. The sharp upper bound on the number, @r, of necessary new vertices among such superstructures for n-vertex general digraphs D is determined, @r being called the inducing regulation number of D. For @D@?(D) being the maximum among semi-degrees in D, simple n-vertex digraphs D with largest possible @r are characterized if either r>=@D@?(D) or r=@D@?(D) (where the case r=@D@? is not a trivial subcase of r>=@D@?).
Computational Modeling in Complex Multinational Domains
Authors: Helen Altman Klein
Venue: IEEE Intelligent Systems (2009)

As international interchanges increase in importance, military, corporate, and humanitarian leaders urgently need to capture national and regional differences. Computational modeling promises to be a powerful tool for representing complex tasks and for testing the validity of these representations. Models may also support decision aids and serve as platforms for training. This essay discusses the need to extend current modeling approaches to better accommodate complexity and to include the variation in behavior, roles, values, and cognition that influence international interchanges.
SORU: A Reconfigurable Vector Unit for Adaptable Embedded Systems
Authors: José M. Moya, Javier Rodríguez, Julio Martín, Juan Carlos Vallejo, Pedro Malagón, Álvaro Araujo, Juan-Mariano Goyeneche, Agustín Rubio, Elena Romero, Daniel Villanueva, Octavio Nieto-Taladriz, Carlos A. López Barrio
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

In this article we describe SORU, a reconfigurable instruction set processor architecture (RISP) specially designed for run-time self-adaptation in environments with tight resource and power restrictions. It allows to accelerate computationally intensive multimedia processing on portable/embedded devices while maintaining a low energy consumption.The experimental results show a mean speedup of 4 with half the energy consumption. The main datapath can be left in a hibernate state during more than 75% of the execution time in our experiments, what leads also to a significant reduction of energy consumption in the I-cache and the main datapath, including the register file.
Multi-layer Intelligent Encapsulation of Manufacturing Resources for MAS-based Distributed Manufacturing System
Authors: Yan Cao, Jiang Du, Yu Bai, Lina Yang, Yanli Yang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In order to deal with dynamic change in a manufacturing environment, all kinds of manufacturing resources are reorganized as multifarious agents with different resources and capability. According to the automation level and working mode of each functional agent to finish its tasks in the manufacturing environment, the manufacturing resource agents are divided into three categories. In order to construct these various agents conveniently, a multi-layer structure is put forward. Based on the structure, the agents can not only rapidly deal with unexpected events, but also recognize and predict the environment change automatically to adjust their behavior. A manufacturing system hierarchical architecture based on MAS is also provided. According to the change of actual productive tasks and the difference of scheduling strategies, the manufacturing system can be reconstructed flexibly by changing the MAS structure and the granularity of the agents. Consequently, it can adapt to the rapid change of the manufacturing environment and the manufacturing resources.
γ-C plane and robustness in static reservoir for nonlinear regression estimation
Authors: Zhiwei Shi, Min Han
Venue: Neurocomputing (2009)

Reservoir method is applied to the feed-forward learning machines for nonlinear regression estimation. Inspired by the existing experience from extreme learning machine (ELM), the new method inherits the basic idea from support vector echo-state machines, but eliminates the internal feedback matrix to adapt for the feed-forward usage. Based on the analysis of nonlinearity in reservoir and regularization in readout weights, the parameters of input scaling and penalty regularization are taken as the hyper-parameters to characterize a static reservoir (ELM), and then a proper reservoir is identified on the @c-C plane based on a generalization error criterion. For outlier suppression, the regularized robust regression is applied in the reservoir feature space, and it leads to an efficient algorithm for large-scale problems, which can be solved by Cholesky decomposition. The proposed method is compared with the classical kernel method and ELM method on several benchmark nonlinear regression datasets, and the results indicate the method is comparable with the existing methods.
Mathematical simulation for optimization of tanning processes; deliming of white hide
Authors: Karel Kolomaznik Michaela Uhlirova, Vladimir Vasek, Dagmar Janacova, Jaroslav Solc
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

In this paper, the authors show the usefulness of theoretical tools of chemical engineering in natural polymer processing, namely on the example of white hide deliming. White hide is a consequent product in the processes in which raw hide is transformed into leather. It is produced in the de-hairing stage which follows the soaking operation. For next operation, tanning, it is necessary to remove calcium hydroxide from white hide. Mathematical descriptions of both non-chemical and chemical deliming are presented, concentration fields of the reacting chemicals described and the importance of the acido-basic boundary inside the white hide shown. Experimental determination of the effective diffusion coefficient is also included. The presented mathematical models can serve as a very good basis for rationalization of the deliming process, save considerable amounts of energies, deliming chemicals and technological water, and make the whole process more environmentally friendly.
A task-based load distribution scheme for multi-server-based distributed virtual environment systems
Authors: Mingyu Lim Dongman Lee
Venue: Presence: Teleoperators and Virtual Environments (2009)

Multi-server-based distributed virtual environment (MSDVE) systems have become prevalent, supporting a large number of internet users. In MSDVEs, the load balancing among servers is an important issue to achieve system scalability. However, existing approaches must pay high migration overhead for the state transition of users or regions, thus the excessive holding time during load distribution makes it difficult for the system to keep the interactive performance acceptable. This paper aims to provide an efficient load distribution mechanism in which a group of servers takes charge of regions and shares region information among servers. The proposed mechanism dynamically classifies task types based on features of requested messages, and distributes each task fairly to neighboring servers. We have implemented the proposed mechanism extending our network framework for DVE, ATLAS, and our experiments show that the task distribution reduces both communication and processing overhead during load distribution without significant classification overhead.
An Island Based Hybrid Evolutionary Algorithm for Optimization
Authors: Changhe Li, Shengxiang Yang
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

Evolutionary computation has become an important problem solving methodology among the set of search and optimization techniques. Recently, more and more different evolutionary techniques have been developed, especially hybrid evolutionary algorithms. This paper proposes an island based hybrid evolutionary algorithm (IHEA) for optimization, which is based on Particle swarm optimization (PSO), Fast Evolutionary Programming (FEP), and Estimation of Distribution Algorithm (EDA). Within IHEA, an island model is designed to cooperatively search for the global optima in search space. By combining the strengths of the three component algorithms, IHEA greatly improves the optimization performance of the three basic algorithms. Experimental results demonstrate that IHEA outperforms all the three component algorithms on the test problems.
An Architecture Design for Evolvable Computer
Authors: Xuesong Yan, Chen Shi, Lishan Kang, Shitan Huang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In recent years, there has been a remarkable growth of the portable computing devices market. To develop and design a scalable, programmable architecture that can be dynamically reconfigured during program execution to a new circuit structure is a key design goal for self-reconfigurable computing systems. In this paper we proposes a new architecture of evolvable computer, this architecture consists of a general-purpose processor, a reconfigurable component (programmable array) and a evolutionary algorithms processor (DSP), and describe the work mechanism of the evolvable computer in detail.