ppxscal/embedding_network huggingface dataset:
Implementing a Change Assimilation Mechanism for Source Routing Interconnects
Authors: Antonio Robles-Gómez, Aurelio Bermúdez, Rafael Casado
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Current high-performance interconnects are switch-based systems using either distributed or source routing. Usually, they incorporate a management mechanism in charge of detecting and assimilating any topological change. In order to restore the connectivity among endpoints, this mechanism must obtain the new topology, and compute and distribute a new set of fabric paths. It is desirable that the change assimilation process is simple, fast, deadlock-free and, above all, it must minimize the impact of the change on the network service. In this work we implement and evaluate a complete management mechanism for source routing networks that accomplishes all these requirements. The proposed scheme results from the combination of previous proposals for each task in the change assimilation process.
Culture and Technologies for Social Interaction
Authors: Qinying Liao, Susan R. Fussell, Sheetal K. Agarwal, Arun Kumar, Amit A. Nanavati, Nitendra Rajput, Yingxin Pan
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

While social activities and user requirements clearly vary across cultures, we are far from having a systematic understanding of culture's role in the design, development and use of social technologies. This workshop will bring together a mix of HCI researchers and practitioners, social scientists and psychologists who are interested in areas of social technologies and culture, in order to (a) examine the design and use of technologies for social interaction in different cultures to date; (b) explore various viewpoints on the key issues for future research; (c) outline various approaches and identify some basic guidelines for understanding cultural impacts in building social technologies as well as user interfaces and (d) foster new collaborations in the community.
Frontiers of Structured Business Process Modeling
Authors: Dirk Draheim
Venue: Transactions on Large-Scale Data- and Knowledge-Centered Systems I (2009)

In this article we investigate in how far a structured approach can be applied to business process modelling. We try to contribute to a better understanding of the driving forces on business process specifications.
Feature Use in Mobile Video Creation
Authors: Arto Puikkonen, Jonna Häkkilä, Rafael Ballagas, Jani Mäntyjärvi
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Today's mobile phones are also video cameras. People are using these ubiquitous cameras to document everyday surroundings as well as create more artistic videos. This paper examines emergent mobile film making patterns by tracking video composition and recording activities in ecologically valid contexts of use. We report the findings of a user study on user created mobile videos, where the actions of 11 active mobile video users were documented for 2 weeks. The collected material included diaries, device logs, and altogether 255 videos. Our findings characterize the features of a typical mobile video. Additionally, our study uncovers common practices, user motivations and pitfalls during filming and editing in the mobile context.
The First Version of a New ASP Solver: ASPeRiX
Authors: Claire Lefèvre, Pascal Nicolas
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We present the first version of our ASP solver ASPeRiX that implements a new approach of answer set computation. The main specifity of our system is to realize a forward chaining of first order rules that are grounded on the fly. So, unlike all others available ASP systems ASPeRiX does not need a pregrounding processing.
A Credit-Based Incentive Mechanism for Recommendation Acquisition in Multihop Mobile Ad Hoc Networks
Authors: Wei Zhou, Zhiqiang Wei, Mijun Kang, Paddy Nixon, Lang Jia
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Trust and reputation systems play an important role in collaborative operations in mobile ad hoc networks. However, the security of trust and reputation system itself is threatened by the existence of selfish nodes. Selfish nodes can make passive attacks on the foundational process of trust and reputation system, the recommendation acquisition, through non cooperation of packet forwarding and recommendation rendering. Existing trust and reputation systems commonly suffer from vulnerability caused by the failure of recommendation acquisition which refers to the unsuccessful recommendation information obtaining from one node to another node. A credit-based mechanism is proposed to address this problem by offering credits as incentives to both intermediate nodes and recommendation render nodes. Furthermore, competition between selfish nodes is explored to prevent selfish nodes being paid excessive credits. Simulation results show that the proposed mechanism can effectively improve the success rate of recommendation acquisition and lower the total paid payoffs.
Do Architectural Knowledge Product Measures Make a Difference in GSD?
Authors: Viktor Clerc
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Architectural knowledge (i.e., architectural decisions and underlying rationale) is pivotal in grasping the level of quality of software architectures and the software products that implement these architectures. When the software products are developed in a global software development context, architectural knowledge becomes of even greater importance because it is needed to overcome challenges associated with global software development. We have performed research on a series of software product assessments to identify what key elements that constitute architectural knowledge are actually used in software products. In addition, we have determined whether a difference exists in the use of the key elements in products that were developed using GSD versus products developed using local, single site development. Our results do not show a significant difference between these two groups, but do point at a lack of both view-based architecture descriptions and of the description of solution fragments in products developed using GSD. 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
State of the Art in Semantic Focused Crawlers
Authors: Hai Dong, Farookh Khadeer Hussain, Elizabeth Chang
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Nowadays, the research of focused crawler approaches the field of semantic web, along with the appearance of increasing semantic web documents and the rapid development of ontology mark-up languages. Semantic focused crawlers are a series of focused crawlers enhanced by various semantic web technologies. In this paper, we make a survey in this research field. We discover eleven semantic focused crawlers from the existing literature, and classify them into three categories --- ontology-based focused crawlers, metadata abstraction focused crawlers and other semantic focused crawlers. By means of a multi-dimensional comparison, we conclude the features of these crawlers and draw the overall state of the art of this field.
Heuristics for a multiperiod inventory routing problem with production decisions
Authors: Jonathan F. Bard, Narameth Nananukul
Venue: Computers and Industrial Engineering (2009)

Manufacturers who resupply a large number of retailers on a periodic basis continually struggle with the question of how to formulate a replenishment strategy. This paper presents a comparative analysis of a series of heuristics for an inventory routing problem (IRP) that arises in a manufacturing supply chain. The IRP is formulated as a mixed integer program with the objective of maximizing the net benefits associated with making deliveries in a specific time period to a widely dispersed set of customers. It is assumed that inventory can accumulate at the customer sites, but that all demand must be met without backlogging. Because optimal solutions were not within reach of exact methods, a two-step procedure was developed that first estimates daily delivery quantities and then solves a vehicle routing problem for each day of the planning horizon. As part of the methodology, a linear program is used to determine which days it is necessary to make at least some deliveries to avoid stockouts. The IRP is investigated in the context of an integrated production-inventory-distribution-routing problem (PIDRP). The full model takes into account production decisions and inventory flow balance in each period. For the computations, a previously developed branch-and-price algorithm is used that requires the solution of multiple IRPs (one in each period) to generate columns for the master problem. Testing showed that PIDRP instances with up to eight time periods and 50 customers can be solved within 1h. This level of performance could not be matched by either CPLEX or an exact version of the branch-and-price algorithm.
A framework for feature-based description of low level discourse
Authors: Laura Alonso Alemany, Ezequiel Andújar Hinojosa, Robert Sola Salvatierra
Venue: Proceedings of the 2004 ACL Workshop on Discourse Annotation (2004)

We present the first stage of the discursive annotation of a corpus in Spanish. In contrast with previous annotation projects, we have applied a feature-based description of discourse relations, and we have focussed in the low level organization of discourse. This first annotation phase has served to settle the annotation framework and to provide empirical support to theoretical claims. Systematic guidelines have been established for the interpretation of relations between discourse units, by tests and interpretation procedures that characterize the presence of the features characterizing discourse relations.
Entry may increase network providers' profit
Authors: Øystein Foros, Hans Jarle Kind, Jan Yngve Sand
Venue: Telecommunications Policy (2009)

In this paper the incentives for platform sponsors to open up their networks for independent rivals is analyzed. It is shown that open access may increase the platform sponsors' profit levels and enhance quality improving investments. In addition, it is shown that a commitment to allow entry reduces the difference between ex ante and ex post compatibility incentives.
Interaction Wearable Computer with Networked Virtual Environment
Authors: Jiung-Yao Huang, Ming-Chih Tung, Huan-Chao Keh, Ji-Jen Wu, Kun-Hang Lee, Chung-Hsien Tsai
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

The goal of this research is to propose a technique to integrate the mobile reality system into the legacy networked virtual environment. This research composes of two essential research domains, one is networked virtual environment (NVE) and the other is mobile computing. With the proposed technique, a user can use a mobile device to join a networked virtual environment and interact with desktop users of the same virtual environment. To achieve this goal, three technical issues have to be solved including mobile networking, resource-shortage and coordinates coordination. The paper presents solutions to all of these issues. Further, a Mobility Supporting Server (MSS) is proposed to implement presented solutions into an existing networked virtual environment, called 3D virtual campus, Taiwan. The result of this experimental research enlightens the possibility of building a Multiplayer Mobile Mixed Reality (M3R) environment in the near future.
Neural network approximation for periodically disturbed functions and applications to control design
Authors: Weisheng Chen, Yu-Ping Tian
Venue: Neurocomputing (2009)

This paper addresses the approximation problem of functions affected by unknown periodically time-varying disturbances. By combining Fourier series expansion into multilayer neural network or radial basis function neural network, we successfully construct two kinds of novel approximators, and prove that over a compact set, the new approximators can approximate a continuously and periodically disturbed function to arbitrary accuracy. Then, we apply the proposed approximators to disturbance rejection in the first-order nonlinear control systems with periodically time-varying disturbances, but it is straightforward to extend the proposed design methods to higher-order systems by using adaptive backstepping technique. A simulation example is provided to illustrate the effectiveness of control schemes designed in this paper.
Research on Using Cult3D and Java to Realize Virtual Assembly
Authors: Ruwei Yun, Baoyun Zhang, Zhigeng Pan
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

According to the needs of model-based assembly in virtual experiments, at the base of making full use of Cult3D, applying Java to expand the function of Cult3D was proposed to realize the interactive model assembly in virtual experiment. The paper analyses the mode of collision detection in procedure of assembling models in virtual experiment, the correspondence between Java and Cult3D and the application of Java multithreading in virtual assembly, which are key technologies for virtual laboratory. Then an example of water tower simulation teaching experiment is supplied.
Dynamic Scheduling of Pigeons for Delay Constrained Applications
Authors: Jiazhen Zhou, Jiang Li, Legand Burge,  Iii
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore highly efficient dynamic scheduling strategies of pigeons for such applications. The upper bound of traffic that can be supported under the deadline constraints for the basic on-demand strategy is given through the analysis. Based on the analysis, a waiting based packing strategy is introduced. Although the latter strategy could not change the maximum traffic rate that a pigeon can support, it improves the efficiency of the pigeon largely. The analytical results are verified by the simulations.
Social Capital Modeling in Virtual Communities: Bayesian Belief Network Approaches
Authors: Ben Kei Daniel
Venue: Premier Reference Source (2009)

Throughout history, the permeation of new technologies have assisted communities in their aim to collectively work together in addressing shared problems for the attainment of specific goals and outcomes. Social Capital Modeling in Virtual Communities: Bayesian Belief Network Approaches broadly examines what constitutes social capital in geographical communities and offers an in-depth description of its potential in virtual communities. Providing the latest findings for advanced undergraduate and graduate students as well as researchers and academicians involved with virtual communities and social capital, this book draws upon insights from interdisciplinary fields such as artificial intelligence, human computer interaction, educational technology, and economics and sociology.
Numberings and Randomness
Authors: Paul Brodhead, Bjørn Kjos-Hanssen
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-Löf random left-computably enumerable reals has a Friedberg numbering, as does the family of all $\Pi^0_1$ classes of positive measure. On the other hand, the $\Pi^0_1$ classes contained in the Martin-Löf random reals do not even have an effective numbering, nor do the left-c.e. reals satisfying a fixed randomness constant. For $\Pi^0_1$ classes contained in the class of reals satisfying a fixed randomness constant, we prove that at least an effective numbering exists.
Research on Test Suite Reduction Using Attribute Relevance Analysis
Authors: Fanping Zeng, Ling Li, Juan Li, Xufa Wang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Essence of software testing is to choose a representative value (known as test case) from the input to perform the programs under test. The actual results of the programs will be checked to verify the consistency with the expected ones. If the results are different, it should take some correction and adjustment correspondingly. The existing method for test suite generation is mainly based on the test requirements which are related to the given testing objectives. It generates the test suites directly. Inevitably, some data in those suites may be redundant and need to be reduced. In fact, test case selection is to make effective partition within the input, and then generate the cases of high-performance. Based on the conception of partition, this paper presents a method of test suite reduction by using data classification techniques which are introduced in data mining. This method tries to use attribute relevance analysis to find the interrelations of all attributes in test requirements, and then reduce the test suite with the most appropriate attributes and values.
Performance Evaluation of PN Code Acquisition with Delay Diversity Receiver for TH-UWB System
Authors: Eun Cheol Kim, Jin Young Kim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

This paper evaluates the pseudo noise (PN) code acquisition with delay diversity receiver for a time hopping-ultra wideband (TH-UWB) system. The detection, overall miss detection, and false alarm probabilities, and mean acquisition time are evaluated over the hypothesis of multiple synchronous states (H 1 cells) in the uncertainty region of the PN code. And the code acquisition performance is evaluated when the correlator output are non-coherently combined by using equal gain combining (EGC) scheme. A constant false alarm rate (CFAR) criterion is applied to the threshold setting rule. From the simulation results, it is demonstrated that the proposed acquisition system with delay diversity receiver achieves a remarkable diversity gain with reasonable complexity. The proposed acquisition scheme can be applied to the UWB base stations in order to enhance the acquisition performance with low complexity.
The adaptation of visual and auditory integration in the barn owl superior colliculus with Spike Timing Dependent Plasticity
Authors: Juan Huo, Alan Murray
Venue: Neural Networks (2009)

To localize a seen object, the superior colliculus of the barn owl integrates the visual and auditory localization cues which are accessed from the sensory system of the brain. These cues are formed as visual and auditory maps. The alignment between visual and auditory maps is very important for accurate localization in prey behavior. Blindness or prism wearing may interfere this alignment. The juvenile barn owl could adapt its auditory map to this mismatch after several weeks training. Here we investigate this process by building a computational model of auditory and visual integration in deep Superior Colliculus (SC). The adaptation of the map alignment is based on activity dependent axon developing in Inferior Colliculus (IC). This axon growing process is instructed by an inhibitory network in SC while the strength of the inhibition is adjusted by Spike Timing Dependent Plasticity (STDP). The simulation results of this model are in line with the biological experiment and support the idea that STDP is involved in the alignment of sensory maps. This model also provides a new spiking neuron based mechanism capable of eliminating the disparity in visual and auditory map integration.
On the Complexity of the Syntax of Tree Languages
Authors: Symeon Bozapalidis, Antonios Kalampakas
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

The syntactic complexity of a tree language is defined according to the number of the distinct syntactic classes of all trees with a fixed yield length. This leads to a syntactic classification of tree languages and it turns out that the class of recognizable tree languages is properly contained in that of languages with bounded complexity. A refined syntactic complexity notion is also presented, appropriate exclusively for the class of recognizable tree languages. A tree language is recognizable if and only if it has finitely many refined syntactic classes. The constructive complexity of a tree automaton is also investigated and we prove that for any reachable tree automaton it is equal with the refined syntactic complexity of its behavior.
Two Paradigms Are Better Than One, and Multiple Paradigms Are Even Better
Authors: Arun K. Majumdar, John F. Sowa
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

During the past half century, the field of artificial intelligence has developed a large number of theories, paradigms, technologies, and tools. Many AI systems are based on one dominant paradigm with a few subsidiary modules for handling exceptions or special cases. Some systems are built from components that perform different tasks, but each component is based on a single paradigm. Since people freely switch from one method of thinking or reasoning to another, some cognitive scientists believe that the ability to integrate multiple methods of reasoning is key to human-like flexibility. In his book The Society of Mind, Minsky (1986) presented an architecture for intelligence based on a society of heterogeneous agents that use different reasoning methods to solve different problems or different aspects of the same problem. That idea is intriguing, but it raises many serious issues: how to coordinate multiple agents, distribute tasks among them, evaluate their results, encourage agents that consistently produce good results, inhibit agents that produce misleading, irrelevant, or unfruitful results, and integrate all the results into a coherent response. The most difficult problem is to enable multiple heterogeneous agents, acting independently, to produce the effect of a single mind with a unified personality that can pursue and accomplish coherent goals. This article discusses ways of organizing a society of heterogeneous agents as an integrated system with flexible methods of reasoning, learning, and language processing.
In silico analysis of motifs in promoters of Differentially Expressed Genes in rice (Oryza sativa L.) under anoxia
Authors: Ashutosh Kumar, Shuchi Smita, Neeti Sahu, Vivekanand Sharma, Shankaracharya, Ambarish S. Vidyarthi, Dev Mani Pandey
Venue: International Journal of Bioinformatics Research and Applications (2009)

The aim of this study was to characterise the molecular mechanisms of transcriptional regulation of Differentially Expressed Genes (DEGs) in rice coleoptiles under anoxia by identifying motifs that are common in the promoter region of co-regulated genes. Un-changed DEGs (&#60;2 fold and &#62;&minus;2), up-regulated DEGs (&ge;2 fold) and down-regulated DEGs (&le;2 fold) were separated in three different data sets. Their gene promoters were extracted from eukaryotic promoter database. Statistically significant consensus promoter motifs were detected by in silico method. A significant variation in the number of promoter motifs, consensus promoter motif and their sequences between UR-DEGs and DR-DEGs were detected that might be responsible for their related expression.