ppxscal/embedding_network huggingface dataset:
A New Method to Model Neighborhood Interaction in Cellular Automata-Based Urban Geosimulation
Authors: Yaolong Zhao, Yuji Murayama
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Local spatial interaction (i.e. neighborhood interaction) between land-use types is an important component in Cellular Automata -based urban geosimulation models. Herein a new method based on the integration of Tobler's First Law of Geography with Reilly's gravity model and coupled with logistical regression approach is proposed to model and calibrate the neighborhood interaction. This method is embedded into a constrained CA model to simulate the spatial process of urban growth in the Tokyo metropolitan area. The results indicate that this method captures the main characteristics of neighborhood interactions in the spatial process of urban growth. Further, this method provides an alternative and extensive approach to present local spatial interactions for "bottom-up" urban models.
Snoopy: a tool to design and animate/simulate graph-based formalisms
Authors: Monika Heiner, Ronny Richter, Martin Schwarick
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along with several pre-fabricated graph classes, especially some kind of Petri nets and other related graphs, and facilitates a comfortable integration of further graph classes due to its generic design. To support an aspect-oriented model engineering, different graph classes may be used simultaneously. Snoopy provides some features (hierarchical nodes, logical nodes), which are particularly useful for larger models, or models with an higher connectivity degree. There are several Petri net classes available, among them the purely qualitative place/transition nets in its standard definition and in a version enhanced by four special arcs as well as two quantitative extensions of it - stochastic Petri nets and continuous Petri nets. Each of these classes enjoys dedicated animation or simulation features. Our tool runs on Windows and Linux operating systems, and it is available free of charge for non-commercial use.
Modelling and simulations of multilane traffic flow by kinetic theory methods
Authors: I. Bonzani, L. M. Gramani Cumin
Venue: Computers Mathematics with Applications (2008)

This paper develops a discrete velocity mathematical model in spatially homogeneous conditions for vehicular traffic along a multilane road. The approach consists of a natural development of a recent model proposed within the framework of the generalized kinetic theory with discrete velocities and described in details in this paper. Numerical simulations are provided for different road conditions and global densities.
On the Improvement of the BDF Attack on LSBS-RSA
Authors: Hung-Min Sun, Mu-En Wu, Huaxiong Wang, Jian Guo
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

An $\left( \alpha ,\beta ,\gamma \right) $-LSBS RSA denotes an RSA system with primes sharing ¿ least significant bits, private exponent d with β least significant bits leaked, and public exponent e with bit-length ¿. Steinfeld and Zheng showed that LSBS-RSA with small e is inherently resistant to the BDF attack, but LSBS-RSA with large e is more vulnerable than standard RSA. In this paper, we improve the BDF attack on LSBS-RSA by reducing the cost of exhaustive search for k, where k is the parameter in RSA equation: $ed=k\cdot \varphi \left( N\right) +1$. Consequently, the complexity of the BDF attacks on LSBS-RSA can be further reduced. Denote ¿ as the multiplicity of 2 in k. Our method gives the improvements, which depend on the two cases: 1 In the case $\gamma \leq \min \left\{ \beta ,2\alpha \right\} -\sigma $, the cost of exhaustive search for k in LSBS-RSA can be simplified to searching k in polynomial time. Thus, the complexity of the BDF attack is independent of ¿, but it still increases as ¿ increases. 1 In the case $\gamma >\min \left\{ \beta ,2\alpha \right\} -\sigma $, the complexity of the BDF attack on LSBS-RSA can be further reduced with increasing ¿ or β. More precisely, we show that an LSBS-RSA is more vulnerable under the BDF attack as $\max \left\{ 2\alpha ,\beta \right\} $ increases proportionally with the size of N. In the last, we point out that although LSBS-RSA benefits the computational efficiency in some applications, one should be more careful in using LSBS-RSA.
Containers
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This chapter describes the predefined container library in Ada 2005. 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
A Tool for Optimizing Runtime Parameters of Open MPI
Authors: Mohamad Chaarawi, Jeffrey M. Squyres, Edgar Gabriel, Saber Feki
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Clustered computing environments, although becoming the predominant high-performance computing platform of choice, continue to grow in complexity. It is relatively easy to achieve good performance with real-world MPI applications on such platforms, but obtaining the best possible MPI performance is still an extremely difficult task, requiring painstaking tuning of all levels of the hardware and software in the system. The Open Tool for Parameter Optimization (OTPO) is a new framework designed to aid in the optimization of one of the key software layers in high performance computing: Open MPI. OTPO systematically tests large numbers of combinations of Open MPI's run-time tunable parameters for common communication patterns and performance metrics to determine the "best" set for a given platform. This paper presents the concept, some implementation details and the current status of the tool, as well as an example optimizing InfiniBand message passing latency by Open MPI.
Summarizing, indexing and browsing of digital videos
Authors: Tiecheng Liu
Venue:  (2007)

It has become clear to the multimedia research community that effective content retrieval should involve more interactions between users and the system. Unfortunately, most existing systems on video search and retrieval are still not user-centered. In these systems, the users are considered as passive agents that only provide the query input. The scope of automatic video retrieval systems is also usually limited in performance and in searching topics.We present a two-level queueing system for dynamic summarization and interactive searching of video content. Using an energy-minimization method, the redundant frames and the frames that constitute the gradual transitions of video shots are removed from the queue. The resulting key frames are linked in a directed-graph-based index structure, allowing video content to be accessed at any level-of-detail. The proposed method can be used for both off-line and on-line video summarization. We also develop a research tool that provides the interactive video content exploration, interactive video content overview, semantic video content fast-forward, and on-demand exploration of video content. Next, we show how the queueing method can also be applied for the content-adaptive summarization of unedited videos such as the home videos. We first show how the energy-minimization method can be used to remove the frames with motion blurs and quick camera motions in the unedited videos. We then introduce a queueing model to analyze the frame leaking probability of the content-redundant frames in the queue. Finally, we show how our queueing model is completely adaptive to these videos.For another genre of the unedited videos, the wearable videos, we provide new summarizing techniques. First, we detect the various user activities by computing the transform of matching image features among video frames. Four basic types of user activities including &ldquo;moving closer/farther&rdquo;, &ldquo;panning&rdquo;, &ldquo;making a turn&rdquo;, and &ldquo;rotation&rdquo; are proposed. We then discuss different summarization techniques for different activity types. Finally, we propose an automated process to summarize the video content as a compact series of panoramic images by estimating the change of depth of the visual scenes due to the motion of the user.
Constitutive interoperability
Authors: Amit K. Chopra, Munindar P. Singh
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Commitments have recently emerged as a valuable abstraction for characterizing interactions among autonomous agents at the level of their business relationships. Traditionally, interoperation is approached from the standpoint of data exchange or of messaging. We use commitments to characterize interoperability in high-level terms: at the level of the communications among agents. Specifically, two agents are interoperable if their commitments align. Drawing upon Kant's famous distinction, we distinguish between two kinds of interoperability, constitutive and regulative. Constitutive interoperability takes into account solely the meaning of messages whereas regulative interoperability also takes into consideration message order, occurrence, and data flow. We present a language for specifying agents constitutively and a decision procedure for determining their interoperability.
On Studying Front-Peer Attack-Resistant Trust and Reputation Mechanisms Based on Enhanced Spreading Activation Model in P2P Environments
Authors: Yufeng Wang, Yoshiaki Hori, Kouichi Sakurai
Venue: Proceedings of the APWeb/WAIM 2007 DBMAN, WebETrends, PAIS and ASWAN international workshops on Advances in Web and Network Technologies, and Information Management (2007)

In this paper, we proposed two enhanced trust propagation and reputation ranking approaches based on spreading activation model to mitigate the effect of front peer. By front peer it means that these malicious colluding peers always cooperate with others in order to increase their reputation, and then provide misinformation to promote actively malicious peers. One approach is to use adaptive spreading factor to reflect the peer's recommendation ability according to behaviors of the peer's direct/indirect children in trust graph; another way is to investigate the feasibility of propagating distrust to effectively combat front peer. Preliminary simulation results show that those approaches can identify and mitigate the attack of front peer.
Decision Support Systems for Public Policy Implementation
Authors: Agneta Ranerup
Venue: Social Science Computer Review (2008)

This article argues that the Internet not only serves as a basis for public service delivery but features in public policy implementation, with the specific aim of supporting the individual's decisions in educational policy, labor market policy, and pension policy. The present study is based on the actor-network theory and illustrates the process during which a decision support system (DSS), provided via the Internet, is part of public policy implementation, with a focus on pension policy and the choice of premium pension funds. The idea of supporting choice via a DSS was supported by many actors - albeit to a lesser degree by citizens' - active use. Technology has developed from providing information and facilities for changing funds online into offering a DSS for advanced financial decisions. A final conclusion is that there are two ways of supporting citizens in choosing funds: the provision of a DSS and simplifying the available options.
Fuzzy-Based Call Admission Control Scheme for Mobile Networks
Authors: Jing-Long Wang, Shu-Yin Chiang
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The fuzzy-based call admission control (CAC) scheme is presented in this paper to offer adaptive services for multimedia stream in next generation wireless networks. Since the contemporary wireless networks will provide a variety of services and each service has multiple levels of quality requirements, but the resource is always scarce. Thus, the adaptive resource allocation for bandwidth is an important issue. In this paper, the proposed CAC scheme considers the adaptive resource requirements to enhance the efficiency of channel utilization in wireless networks. When a new call is arriving, the CAC scheme will evaluate if the available bandwidth can satisfy the requirement of incoming call. Whenever the available bandwidth is not sufficient to meet the requirement, the CAC scheme is based on fuzzy logic to choose an existing call, of which the allocated bandwidth will be degraded in order to release some bandwidth for the incoming call. From the results of simulation, the proposed scheme is superior to the existing scheme.
A Supervised Feature Extraction Algorithm for Multi-class
Authors: Shifei Ding, Fengxiang Jin, Xiaofeng Lei, Zhongzhi Shi
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

In this paper, a novel supervised information feature extraction algorithm is set up. Firstly, according to the information theories, we carried out analysis for the concept and its properties of the cross entropy, then put forward a kind of lately concept of symmetry cross entropy (SCE), and point out that the SCE is a kind of distance measure, which can be used to measure the difference of two random variables. Secondly, Based on the SCE, the average symmetry cross entropy (ASCE) is set up, and it can be used to measure the difference degree of a multi-class problem. Regarding the ASCE separability criterion of the multi-class for information feature extraction, a novel algorithm for information feature extraction is constructed. At last, the experimental results demonstrate that the algorithm here is valid and reliable, and provides a new research approach for feature extraction, data mining and pattern recognition.
Mobile Peer-to-Peer Technology Used in Mobile Education Field
Authors: Liang Ye, Ci Lin-Lin
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Mobile Education is a new way of using wireless and mobile technologies for education, and it usually applies to nature-based field study. However, the fee of use is so high that few people could accept this new learning method. But we take note of that the message, required by users coming from the same group with wireless communication equipments, usually focuses on a certain area. So, we could use the mobile peer-to-peer (MP2P) technology to resolve this confliction. MP2P network can let messages be transferred in the group instead of in the whole communication system, and this could save the messages in the group and meet the need of other users through storage and transmitting. So the users could cut down the fee of using mobile education system.
Event-Based Motion Control for Mobile-Sensor Networks
Authors: Zack Butler, Daniela Rus
Venue: IEEE Pervasive Computing (2003)

In many situations involving deployment of a sensor network, far more sensor units are available than necessary for simple coverage of the space. Adding sensor mobility can exploit this redundancy by repositioning sensors to mitigate sensor failure and to enhance the group's sensing capabilities. When events occur frequently in particular areas, a higher data resolution in that area, and hence more sensors, would be preferable. So, the sensors should move to these areas reactively. Two distributed algorithms let mobile sensors react to events such that the distribution of the group of sensors tends toward the distribution of the sensed events. These algorithms use minimal communication and computation. Several extensions to these algorithms maintain approximately complete coverage of the environment while still converging on the event distribution. The coverage techniques vary in the amount of computation and communication required.
How Reliable Are Practical Point-in-Polygon Strategies?
Authors: Stefan Schirra
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. However, our experiments reveal that the tested code often fails for more challenging degenerate and also nearly degenerate queries.
Techniques of Dialogue Simulation
Authors: Fred Roberts, Björn Gülsdorff
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We claim that it is more effective to simulate intelligence than it is to recreate it. To this end several of the classic social psychological theories suggest strategies to transform the dialogue into an encounter with a consistent and cohesive personality. The secret is to use the mind-set of the user to the advantage of the conversation, and to provoke the user into showing typical behavior. This is presented in an online system: Elbot.com.
An Efficient Watermarking Technique Using ADEW and CBWT for Copyright Protection
Authors: Goo-Rak Kwon, Seung-Won Jung, Sung-Jea Ko
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In this paper, we propose an efficient watermarking technique using adaptive differential energy watermarking (ADEW) and cross binding wavelet tree (CBWT) for copyright protection. The ADEW embeds a secret bit string using the reference threshold with experimental statistics. The proposed method not only takes advantage of the ADEW's error resilience but corrects a secret bit string by using ECC after error occurrence. Experimental results indicated that the proposed method provides better robustness against attacks than the conventional DEW approaches.
Using Public Procurement to Ensure That Accessible ICT Products and Services Are Available for All European Citizens (ETSI HF STF 333)
Authors: Richard Hodgkinson
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Developments in the USA, Canada and Australia have proved the value of using the purchasing power of public procurement to influence the accessibility of ICT products and services for all citizens, not only those who work for government organisations, or use government services.In late 2005 the EC adopted Mandate M/376 and the main European standards organisations, ETSI and CEN/CENELEC were instructed to prepare for the work.Phase 1 of M/376 requires ETSI to review and report on current ICT accessibility legislation, policies, procurement requirements and standards, and CEN/CENELEC to review and report on conformity assessment for accessible ICT.This paper describes the work of the work carried out by ETSI in Human Factors Specialist Task Force (HF STF) 333 - European Accessibility Requirements for Public Procurement of Products and Services in the ICT Domain - EC Standardisation Mandate M/376, Phase 1.
An Improved OCDMA/OCDMA Overloading Scheme for Cellular DS-CDMA
Authors: Preetam Kumar, Saswat Chakrabarti
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

Overloading is a scheme to accommodate more users than the spreading factor N. This is a bandwidth efficient scheme to increase the number of users in a fixed bandwidth. One of the efficient schemes to overload a CDMA system is to use two sets of orthogonal signal waveforms (O/O). The first set is assigned to the N users and the second set is assigned to the additional users. An iterative multistage detection (IMSD) technique is used to cancel interference between the two sets of users. The interference cancellation receiver uses hard decisions (HDIC) or soft decisions (SDIC) to estimate the interference. In this paper, the BER performance of a new overloading scheme using scrambled orthogonal Gold code (OG/OG) sets is evaluated with SDIC receiver. When complex scrambling is not used, it is shown that OG/OG scheme provides 25% (16 extra users) channel overloading for synchronous DS-CDMA system in an AWGN channel, with an SNR degradation of about 0.35 dB as compared to single user bound at a BER of 10 ¿ 5. We have evaluated the overloading performance, when the two set are scrambled with set specific deterministic or random complex scrambling sequence. It is shown that the amount of overloading increases significantly from 25% to 63% (40 extra users) by using random complex scrambling for N=64. For deterministic (periodic) scrambling, the overloading percentage increases considerably to 78%. On a Rayleigh fading channel, an overloading of 100% is obtained at a BER of 10 ¿ 5 with near single user user performance.
Semi-supervised Collaborative Text Classification
Authors: Rong Jin, Ming Wu, Rahul Sukthankar
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Most text categorization methods require text content of documents that is often difficult to obtain. We consider "Collaborative Text Categorization", where each document is represented by the feedback from a large number of users. Our study focuses on the semi-supervised case in which one key challenge is that a significant number of users have not rated any labeled document. To address this problem, we examine several semi-supervised learning methods and our empirical study shows that collaborative text categorization is more effective than content-based text categorization and the manifold regularization is more effective than other state-of-the-art semi-supervised learning methods.
Execution Optimization for Composite Services Through Multiple Engines
Authors: Wubin Li, Zhuofeng Zhao, Jun Fang, Kun Chen
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (WSMSME) that enables executing composite services through multiple engines. This paper tackles a first basic WSMSME problem: execution optimization for composite services through multiple engines. Our main result comprises two dynamic programming algorithms. One helps minimizes the number of engines required to complete a composite service when computational capability of each engine is relatively changeless; the other optimally minimizes the heaviest load of engines by segmenting a pipelined execution plan into sub-sequences before they are dispatched and executed; Both of the two can obtain optimal solutions in polynomial time. Experiments with an initial prototype indicate that our algorithms can lead to significant performance improvement over more straightforward techniques.
Macro-level Traceability Via Media Transformations
Authors: Orlena C. Gotel, Stephen J. Morris
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

This paper proposes an alternative approach to the examination of artifacts whose contents must be traceable to promote software quality. The approach places emphasis on media use and media transformations. We suggest that one cannot begin to assign and sustain traceability relations at a micro-level between units of content if the sign systems that have been created and transformed to represent this content are not considered at a more macro-level. Our approach is anticipatory, feasible to automate and exemplified.