ppxscal/embedding_network huggingface dataset:
Implementation of hierarchical GAF, a cooperative power saving scheme for sensor networks
Authors: Takashi Osawa, Tokuya Inagaki, Susumu Ishihara
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

The sensor nodes of wireless sensor networks are placed in observation areas and transmit data to the observer by using multi-hop communication between nodes. Because these nodes are small and have a limited power supply, they must save power in order to prolong the networks lifetime. In our previous work, we proposed a power saving technique called HGAF (Hierarchical Geographic Adaptive Fidelity) that gives a layered structure to GAF (Geographic Adaptive Fidelity) and takes into account the positions of nodes. We implemented HGAF on MICAz-Motes and evaluated its energy consumption in comparison with that of GAF in an actual environment. The experimental results shows that HGAF can prolong the network lifetime.
A Multi Agent Architecture Based on PGN-AO Model
Authors: Jun Hu, Shen Huang, Jeanine Umugwaneza
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In current research of Agent, Agent architecture is an important topic. Architecture of multi-agent system had been proposed to explain the relationship among the policy control layer, the self-control and behavior constraint layer, the organizational management layer and the middle connection layer. In policy control layer, we design two kinds of organizations, and a set of behavior rules, which can be seemed as the higher command of the self-control and behavior constraint layer. In self-control and behavior constraint layer, we implement policy driven autonomic agent model, to map regulation into agent’s behavior. Finally, the middle connection layer is used for connecting the above two layers.
Strategic impact of e-government on economy and society
Authors: Wojciech Cellary
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Each society requires information and communication between people. Available information and communication could deeply influence economy and governance of a society. Appearance and spread of the Internet has substantially changed information and communication impacting economy and governance. The changes may be very beneficial to a society when the right strategy is adopted for harmonizing governmental and economical issues. It appears that most of problems related with transformation of business into e-business and government into e-government are quite similar in different countries independently of the level of their development. The aim of this tutorial is to discuss the strategic impact of e-government on economy and society. In the tutorial, e-Government is seen as a lever to e-economy providing young people finishing schools and universities with a possibility to create job in innovative enterprises offering e-content and e-services for both private and public sectors. The tutorial also discusses conditions under which transformation of traditional government into e-government may contribute to cutting costs of administration and improving its efficiency. The main aim of the workshop is to share experiences of people involved in e-government solutions development and deployment. The workshop provides an opportunity of mutual inspiration on problem solving provided by people coming from different developing countries.
Fast arithmetic for triangular sets: From theory to practice
Authors: Xin Li, Marc Moreno Maza, Éric Schost
Venue: Journal of Symbolic Computation (2009)

We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean division, we obtain theoretical and practical improvements over a direct recursive approach; for a family of special cases, we reach quasi-linear complexity. The main outcome we have in mind is the acceleration of higher-level algorithms, by interfacing our low-level implementation with languages such as AXIOM or Maple. We show the potential for huge speed-ups, by comparing two AXIOM implementations of van Hoeij and Monagan's modular GCD algorithm.
Genetic algorithm for text clustering using ontology and evaluating the validity of various semantic similarity measures
Authors: Wei Song, Cheng Hua Li, Soon Cheol Park
Venue: Expert Systems with Applications: An International Journal (2009)

This paper proposes a self-organized genetic algorithm for text clustering based on ontology method. The common problem in the fields of text clustering is that the document is represented as a bag of words, while the conceptual similarity is ignored. We take advantage of thesaurus-based and corpus-based ontology to overcome this problem. However, the traditional corpus-based method is rather difficult to tackle. A transformed latent semantic indexing (LSI) model which can appropriately capture the associated semantic similarity is proposed and demonstrated as corpus-based ontology in this article. To investigate how ontology methods could be used effectively in text clustering, two hybrid strategies using various similarity measures are implemented. Experiments results show that our method of genetic algorithm in conjunction with the ontology strategy, the combination of the transformed LSI-based measure with the thesaurus-based measure, apparently outperforms that with traditional similarity measures. Our clustering algorithm also efficiently enhances the performance in comparison with standard GA and k-means in the same similarity environments.
Termination of Narrowing Using Dependency Pairs
Authors: María Alpuente, Santiago Escobar, José Iborra
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In this work, we extend the dependency pair approach for automated proofs of termination in order to prove the termination of narrowing. Our extension of the dependency pair approach generalizes the standard notion of dependency pairs by taking specifically into account the dependencies between the left-hand side of a rewrite rule and its own argument subterms. We demonstrate that the new narrowing dependency pairs exactly capture the narrowing termination behavior and provide an effective termination criterion which we prove to be sound and complete. Finally, we discuss how the problem of analyzing narrowing chains can be recast as a standard analysis problem for traditional (rewriting) chains, so that the proposed technique can be effectively mechanized by reusing the standard DP infrastructure.
nfais/FID world inventory of absteracting and indexing services
Authors: Toni Carbo Bearman
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The National Federation of Abstracting and Indexing Services (nfais) is a Federation of not-for-profit organizations and government agencies that are engaged in abstracting and indexing. The Federation was incorporated in 1958 under the name of National Federation of Science Abstracting and Indexing Services; the word Science was dropped from the name in 1972, thus broadening the membership to include services in the humanities and the social sciences. There are currently more than thirty member services. There is no individual membership in the Federation.
An introduction to the perturbation-based stochastic finite volume method for plane heat conduction problems
Authors: Marcin Kaminski, Rafał Leszek Ossowski
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This article refers to the Stochastic Finite Volume Method based on the perturbation technique, which allows a numerical solution of the general stationary transport equations with random parameters. Since the generalized version of the perturbation method is employed here, there are no limitations on the coefficients of variation for the input random variables. A comparison against the traditional Monte-Carlo simulation enables a precise computational validation of this technique. Numerical results obtained for the very elementary example of a plane heat conduction with randomized heat conductivity solved by the Finite Volume Method shows practically no difference between the perturbation and the simulation probabilistic methods.
Multidimensional generalized fuzzy integral
Authors: Yasuo Narukawa, Vicenç Torra
Venue: Fuzzy Sets and Systems (2009)

In this paper, we study multidimensional integrals. We introduce a generalized fuzzy integral and we present a Fubini-like theorem for this generalized fuzzy integral. As this research was partly motivated by the definition of citation indices, we also describe how such multidimensional integrals can be used to define such indices.
Using Eigenvoice Coefficients as Features in Speaker Recognition
Authors: Haipeng Wang, Qingwei Zhao, Yonghong Yan
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Eigenvoice speaker adaptation has been shown to be effective in recent years. In this paper, we propose to use eigenvoice coefficients as features for speaker recognition. We use a simplified version of probabilistic subspace adaptation (PSA) to estimate eigenvoice coefficients, and the coefficients are concatenated to construct supervectors of support vector machines. This approach significantly reduces the dimension of feature vector, and leads to a great reduction of training time cost. We then design a simple and effective feature normalization method, which uses eigenvalues for variance normalization. Our approach is evaluated on the SRE2008 NIST evaluation and exhibits better performance than the conventional eigenGMM approach.
Data-driven exploration of musical chord sequences
Authors: Eric Nichols, Dan Morris, Sumit Basu
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

We present data-driven methods for supporting musical creativity by capturing the statistics of a musical database. Specifically, we introduce a system that supports users in exploring the high-dimensional space of musical chord sequences by parameterizing the variation among chord sequences in popular music. We provide a novel user interface that exposes these learned parameters as control axes, and we propose two automatic approaches for defining these axes. One approach is based on a novel clustering procedure, the other on principal components analysis. A user study compares our approaches for defining control axes both to each other and to an approach based on manually-assigned genre labels. Results show that our automatic methods for defining control axes provide a subjectively better user experience than axes based on manual genre labeling.
Input-agreement: a new mechanism for collecting data using human computation games
Authors: Edith Law, Luis von Ahn
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Since its introduction at CHI 2004, the ESP Game has inspired many similar games that share the goal of gathering data from players. This paper introduces a new mechanism for collecting labeled data using "games with a purpose." In this mechanism, players are provided with either the same or a different object, and asked to describe that object to each other. Based on each other's descriptions, players must decide whether they have the same object or not. We explain why this new mechanism is superior for input data with certain characteristics, introduce an enjoyable new game called "TagATune" that collects tags for music clips via this mechanism, and present findings on the data that is collected by this game.
Constraint graph-based macro placement for modern mixed-size circuit designs
Authors: Hsin-Chen Chen, Yi-Lin Chuang, Yao-Wen Chang, Yung-Chung Chang
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

In this paper, we propose a constraint graph-based macro placement algorithm that removes macro overlaps and optimizes macro positions for modern mixed-size circuit designs. Improving over the constraint graph by working only on its essential edges without loss of the solution quality, our algorithm can search for high-quality macro placement solutions effectively and efficiently. Instead of packing macros along chip boundaries like most recent previous work, our placer can determine a non-compacted macro placement by linear programming and placement region cost evaluation and handle various placement constraints/objectives. Compared with various leading academic macro placers, our algorithm can consistently and significantly reduce the wirelengths for designs with different utilization rates, implying that our macro placer is robust and has very high quality.
Cluster-Based Security for Wireless Sensor Networks
Authors: Maan Younis Abdullah, Gui Wei Hua
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

This paper examine the problem of adding security to cluster based communication protocols for homogeneous wireless sensor networks consisting of sensor nodes with severely limited resources, and propose a security solution where clusters are formed dynamically and periodically. Our solution describes re-keying function protocol for wireless sensor networks security. We proposed the local administrative functions (LAFs) as master function, re-keying function, and derivation function is imprinted with sensor node. A security and performance analysis show that is very efficient in computation, communication, storage and that our method is very effective in defending against many sophisticated attacks.
CMMI-ACQ: Guidelines for Improving the Acquisition of Products and Services, 1 edition
Authors: Brian P. Gallagher, Mike Phillips, Karen J. Richter, Sandy Shrum
Venue: SEI Series In Software Engineering (2009)

CMMI-ACQ (Capability Maturity Model Integration for Acquisition) describes best practices for the successful acquisition of products and services. Providing a practical framework for improving acquisition processes, CMMI-ACQ addresses the growing trend in business and government for organizations to purchase or outsource required products and services as an alternative to in-house development or resource allocation. Modeled after CMMI, Second Edition, which documented CMMI for Development, this book is the definitive reference for the current release of CMMI for Acquisition (version 1.2). In addition to the entire CMMI-ACQ model, the book includes tips, hints, cross-references, and other author notes to help you understand, apply, and find more information about the content of the acquisition process areas. The authors also have added two chapters to illustrate the application of CMMI-ACQ in industry (a case study from General Motors) and government. Whether you are new to CMMI models or are already familiar with one or more of them, you will find this book an essential resource for managing your acquisition processes and improving your overall performance. The book is divided into three parts. Part One introduces CMMI-ACQ in the broad context of CMMI models, including essential concepts and useful background. It then describes and shows the relationships among all the components of the CMMI-ACQ process areas, and explains paths to the adoption and use of the model for process improvement and benchmarking. Finally, two separate chapters describe special acquisition needs in a government environment and real experiences with CMMI-ACQ from industry. Part Two first describes generic goals and generic practices, and then, in twenty-two sections, details each of the CMMI-ACQ process areas, including specific goals, specific practices, and examples. These process areas are organized alphabetically by process area acronym to facilitate quick reference. Part Three provides several useful references, including sources for further information about CMMI and CMMI-ACQ, acronym definitions, a glossary of terms, and an index.
Kieselstein (Pebble Stone)
Authors: Ellen Hoffmann
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

While playing outside the house, little Lisa builds her own playmate from various objects. But when her mother asks her to tidy up and come to dinner, Lisa has a problem. Her new friend is not willing to be cleaned up.
A constraint based role based access control in the SECTET a model-driven approach
Authors: Muhammad Alam
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

With respect to Service Oriented Architectures (SOA's) paradigm, the core Role Based Access Control (RBAC) has several limitations. In SOA, permissions to execute web services are not assigned statically to roles but are associated with a set of Permission Assignment Constraints (PAC) upon the fulfilment of which a role is assigned a permission to execute a web service. Further, the RBAC does not support partial inheritance which is an integral requirement in SOA. A major challenge in SOA is the inheritance of permissions associated with PAC in the presence of role hierarchies. This contribution has three objectives. First we propose an extension to Role Based Access Control [29], Constraint based RBAC (CRBAC), in order to make RBAC applicable into the dynamic environment of SOA. We then present SECTET-PL [31], a high-level language for the specification of PAC. Being part of the SECTET-framework for model-driven security for B2B-workflows, SECTET-PL is a policy language influenced by OCL [23] and interpreted in the context of UML models. Finally, using Model Driven Architecture (MDA) [18] paradigm, we describe the integration of business requirements and security requirements at the metalevel. The high-level security (CRBAC) models are transformed to low-level web services standard artefacts with the help of Eclipse Modelling Framework and OpenArchitectureWare.
Secure and low latency handoff scheme for proxy mobile IPv6
Authors: HyunGon Kim, ByeongKyun Oh
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Recently wireless 3rd generation mobile telecommunication service providers have been showing strong interest in network-based localized mobility management. This could be a prominent way to support IP mobility to mobile nodes, because it requires minimal functionality on the mobile node. However, there is a limited understanding of security provisioning, security infrastructure, low latency handoff, and deployment scenarios, etc. With the fundamental aim low latency handoff in the proxy Mobile IPv6, we introduce a new approach to minimize handoff latency which could eliminate time required for re-authentication by AAA server while the mobile node is roaming across the localized Proxy Mobile IPv6 domains. From a security perspective, this allows mobile access gateways to exchange mobile node's policy profile and ongoing session securely using a variant of the Diffie-Hellman key agreement. To learn its feasibility, security analysis and handoff latency compared to existing handoff schemes are presented. The result shows that latency of the proposed handoff scheme is relatively lower than latency of the handoff scheme across Proxy Mobile IPv6 domains. This provides the confidentiality and integrity of a mobile node's policy profile and ongoing sessions in the exchange phase additionally.
Maximizing Unavailability Interval for Energy Saving in IEEE 802.16e Wireless MANs
Authors: Tuan-Che Chen, Jyh-Cheng Chen, Ying-Yu Chen
Venue: IEEE Transactions on Mobile Computing (2009)

This paper presents an energy conservation scheme, Maximum Unavailability Interval (MUI), to improve the energy efficiency for the Power Saving Class of Type II in IEEE 802.16e. By applying the Chinese Remainder Theorem, the proposed MUI is guaranteed to find the maximum Unavailability Interval, during which the transceiver can be powered down. We also propose new mathematical techniques to reduce the computational complexity when solving the Chinese Remainder Theorem problem. Because the computational complexity is reduced significantly, the proposed MUI can be practically implemented in real systems. The proposed MUI is fully compatible with the 802.16e standard. It provides a systematic way to determine the start frame number, one of the important parameters defined in the standard. In addition to analyzing the computational complexity, simulations and experiments are conducted to evaluate the performance of the proposed algorithms.
Morphological Diversity and Sparsity for Multichannel Data Restoration
Authors: J. Bobin, Y. Moudden, J. Fadili, J. -L. Starck
Venue: Journal of Mathematical Imaging and Vision (2009)

Over the last decade, overcomplete dictionaries and the very sparse signal representations they make possible, have raised an intense interest from signal processing theory. In a wide range of signal processing problems, sparsity has been a crucial property leading to high performance. As multichannel data are of growing interest, it seems essential to devise sparsity-based tools accounting for such specific multichannel data. Sparsity has proved its efficiency in a wide range of inverse problems. Hereafter, we address some multichannel inverse problems issues such as multichannel morphological component separation and inpainting from the perspective of sparse representation. In this paper, we introduce a new sparsity-based multichannel analysis tool coined multichannel Morphological Component Analysis (mMCA). This new framework focuses on multichannel morphological diversity to better represent multichannel data. This paper presents conditions under which the mMCA converges and recovers the sparse multichannel representation. Several experiments are presented to demonstrate the applicability of our approach on a set of multichannel inverse problems such as morphological component decomposition and inpainting.
Up and coming SIGWEB supported conferences
Authors: Yogesh Deshpande
Venue: Issue Spring (March 2009) (2009)

SIGWEB supports several specialized conferences, short courses, and workshops, as well as the Annual Hypertext Conference. SIGWEB sponsored conferences focus on timely topics in applied and computational hypertext and Web disciplines and provide a place for members and the entire applied Hypermedia and Web community to exchange ideas and to meet with and expand their network of colleagues. In this article, we provide a brief overview of SIGWEB sponsored conferences, in addition to events that are in cooperation with SIGWEB.
Flow-based Description of Conceptual and Design Levels
Authors: Sabah Al-Fedaghi
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Building an Information System involves a first phase of conceptual modeling of the “real world domain,” then a second phase of design of the software system. For describing the software system, object-oriented methods and languages (e.g., UML) are typically used. For the system analysis process that produces the conceptual description, object-oriented techniques or their semantic extensions are used. This paper concentrates on UML as the most widely used language for these purposes. It proposes an alternative to extending UML, through development of a conceptual modeling methodology based on the notion of flow. This flow model provides a conceptually uniform applied description that is appropriate for the system analysis phase.
On reciprocal complementary Wiener number
Authors: Bo Zhou, Xiaochun Cai, Nenad Trinajstić
Venue: Discrete Applied Mathematics (2009)

We report properties, especially upper and lower bounds and the Nordhaus-Gaddum-type result for the reciprocal complementary Wiener number of a connected (molecular) graph.