ppxscal/embedding_network huggingface dataset:
Design patterns from biology for distributed computing
Authors: Ozalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni A. Di Caro, Frederick Ducatelle, Luca M. Gambardella, Niloy Ganguly, Márk Jelasity, Roberto Montemanni, Alberto Montresor, Tore Urnes
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2006)

Recent developments in information technology have brought about important changes in distributed computing. New environments such as massively large-scale, wide-area computer networks and mobile ad hoc networks have emerged. Common characteristics of these environments include extreme dynamicity, unreliability, and large scale. Traditional approaches to designing distributed applications in these environments based on central control, small scale, or strong reliability assumptions are not suitable for exploiting their enormous potential. Based on the observation that living organisms can effectively organize large numbers of unreliable and dynamically-changing components (cells, molecules, individuals, etc.) into robust and adaptive structures, it has long been a research challenge to characterize the key ideas and mechanisms that make biological systems work and to apply them to distributed systems engineering. In this article we propose a conceptual framework that captures several basic biological processes in the form of a family of design patterns. Examples include plain diffusion, replication, chemotaxis, and stigmergy. We show through examples how to implement important functions for distributed computing based on these patterns. Using a common evaluation methodology, we show that our bio-inspired solutions have performance comparable to traditional, state-of-the-art solutions while they inherit desirable properties of biological systems including adaptivity and robustness.
Duality between matrix variate t and matrix variate V.G. distributions
Authors: Solomon W. Harrar, Eugene Seneta, Arjun K. Gupta
Venue: Journal of Multivariate Analysis (2006)

The (univariate) t-distribution and symmetric V.G. distribution are competing models [D.S. Madan, E. Seneta, The variance gamma (V.G.) model for share market returns, J. Business 63 (1990) 511-524; T.W. Epps, Pricing Derivative Securities, World Scientific, Singapore, 2000 (Section 9.4)] for the distribution of log-increments of the price of a financial asset. Both result from scale-mixing of the normal distribution. The analogous matrix variate distributions and their characteristic functions are derived in the sequel and are dual to each other in the sense of a simple Duality Theorem. This theorem can thus be used to yield the derivation of the characteristic function of the t-distribution and is the essence of the idea used by Dreier and Kotz [A note on the characteristic function of the t-distribution, Statist. Probab. Lett. 57 (2002) 221-224]. The present paper generalizes the univariate ideas in Section 6 of Seneta [Fitting the variance-gamma (VG) model to financial data, stochastic methods and their applications, Papers in Honour of Chris Heyde, Applied Probability Trust, Sheffield, J. Appl. Probab. (Special Volume) 41A (2004) 177-187] to the general matrix generalized inverse gaussian (MGIG) distribution.
Using a CSCL tool to support a legislative role-playing simulation: hopes, fears, and challenges
Authors: Todd C. Reimer, Daniel C. Edelson
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Educators are increasingly seeking opportunities to engage their students in active learning through authentic experiences. These authentic curricula, however, often require students to communicate with their peers to a degree that is difficult to achieve within the rigid structure of most schools. This paper addresses the hopes and fears of three teachers' experience integrating collaborative software to support approximately 370 students in their efforts to communicate and collaborate within the competitive context of a legislative role-playing simulation. Following a brief overview of the design, the paper address the teachers' fears, hopes, and remaining challenges.
View merging in the presence of incompleteness and inconsistency
Authors: Mehrdad Sabetzadeh, Steve Easterbrook
Venue: Requirements Engineering (2006)

View merging, also called view integration, is a key problem in conceptual modeling. Large models are often constructed and accessed by manipulating individual views, but it is important to be able to consolidate a set of views to gain a unified perspective, to understand interactions between views, or to perform various types of analysis. View merging is complicated by incompleteness and inconsistency: Stakeholders often have varying degrees of confidence about their statements. Their views capture different but overlapping aspects of a problem, and may have discrepancies over the terminology being used, the concepts being modeled, or how these concepts should be structured. Once views are merged, it is important to be able to trace the elements of the merged view back to their sources and to the merge assumptions related to them. In this paper, we present a framework for merging incomplete and inconsistent graph-based views. We introduce a formalism, called annotated graphs, with a built-in annotation scheme for modeling incompleteness and inconsistency. We show how structure-preserving maps can be employed to express the relationships between disparate views modeled as annotated graphs, and provide a general algorithm for merging views with arbitrary interconnections. We provide a systematic way to generate and represent the traceability information required for tracing the merged view elements back to their sources, and to the merge assumptions giving rise to the elements.
i-GAME: An Implicit GTS Allocation Mechanism in IEEE 802.15.4 for Time-Sensitive Wireless Sensor Networks
Authors: Anis KOUBAA, Mario ALVES, Eduardo TOVAR
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling technology for time sensitive wireless sensor networks thanks to its Guaranteed-Time Slot (GTS) mechanism in the beacon-enabled mode. However, the protocol only supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTSs may be only partially used, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of a GTS by multiple nodes, while all their (delay, bandwidth) requirements are still satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our proposal improves the bandwidth utilization compared to the explicit allocation used in the IEEE 802.15.4 protocol standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons.
Ultralow parasitic eigenvalues for oscillation problem of a guided elastic flying vehicle that contains integrating section in a feedback loop
Authors: S. V. Arinchev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Integration sections are frequently inserted in feedback loops of flight control systems. They usually help to increase the accuracy of flight control. But at the same time such an engineering solution can change significantly dynamic properties of the guided elastic structure. The oscillation system becomes unconservative. The number of degrees of freedom continues to be the same but the quantity of modes increases. Ultralow parasitic eigenvalues appear. They are named ultralow ones because they tend to zero together with the feedback loop amplification factor. They are named parasitic ones because they interact with the main eigenvalues. The interaction of the ultralow parasitic oscillation mode and the main oscillation mode can cause dynamic instability. It is shown in this issue that violations of the principle oscillation theorems (oscillation properties) take place for the parasitic oscillation modes [S.V. Arinchev, 2002]. 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
Bridging Functional MR Images and Scientific Inference: Reproducibility Maps
Authors: Michelle Liou, Hong-Ren Su, Juin-Der Lee, Philip E. Cheng, Chien-Chih Huang, Chih-Hsin Tsai
Venue: Journal of Cognitive Neuroscience (2003)

Historically, reproducibility has been the sine qua non of experimental findings that are considered to be scientifically useful. Typically, findings from functional magnetic resonance imaging (fMRI) studies are assessed with statistical parametric maps (SPMs) using a p value threshold. However, a smaller p value does not imply that the observed result will be reproducible. In this study, we suggest interpreting SPMs in conjunction with reproducibility evidence. Reproducibility is defined as the extent to which the active status of a voxel remains the same across replicates conducted under the same conditions. We propose a methodology for assessing reproducibility in functional MR images without conducting separate experiments. Our procedures include the empirical Bayes method for estimating effects due to experimental stimuli, the threshold optimization procedure for assigning voxels to the active status, and the construction of reproducibility maps. In an empirical example, we implemented the proposed methodology to construct reproducibility maps based on data from the study by Ishai et al. (2000). The original experiments involved 12 human subjects and investigated brain regions most responsive to visual presentation of 3 categories of objects: faces, houses, and chairs. The brain regions identified included occipital, temporal, and fusiform gyri. Using our reproducibility analysis, we found that subjects in one of the experiments exercised at least 2 mechanisms in responding to visual objects when performing alternately matching and passive tasks. One gave activation maps closer to those reported in Ishai et al., and the other had related regions in the precuneus and posterior cingulate. The patterns of activated regions are reproducible for at least 4 out of 6 subjects involved in the experiment. Empirical application of the proposed methodology suggests that human brains exhibit different strategies to accomplish experimental tasks when responding to stimuli. It is important to correlate activations to subjects' behavior such as reaction time and response accuracy. Also, the latency between the stimulus presentation and the peak of the hemodynamic response function varies considerably among individual subjects according to types of stimuli and experimental tasks. These variations per se also deserve scientific inquiries. We conclude by discussing research directions relevant to reproducibility evidence in fMRI.
Resource-aware multi-format network security data storage
Authors: Evan Cooke, Andrew Myrick, David Rusek, Farnam Jahanian
Venue: Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense (2006)

Internet security systems like intrusion detection and intrusion prevention systems are based on a simple input-output principle: they receive a high-bandwidth stream of input data and produce summaries of suspicious events. This simple model has serious drawbacks, including the inability to attach context to security alerts, a lack of detailed historical information for anomaly detection baselines, and a lack of detailed forensics information. Together these problems highlight a need for fine-grained security data in the shortterm, and coarse-grained security data in the long-term. To address these limitations we propose resource-aware multi-format security data storage. Our approach is to develop an architecture for recording different granularities of security data simultaneously. To explore this idea we present a novel framework for analyzing security data as a spectrum of information and a set of algorithms for collecting and storing multi-format data. We construct a prototype system and deploy it on darknets at academic, Fortune 100 enterprise, and ISP networks. We demonstrate how a hybrid algorithm that provides guarantees on time and space satisfies the short and long-term goals across a four month deployment period and during a series of large-scale denial of service attacks.
Mobile functionality in a pervasive world
Authors: J. Jagiello
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

K. Eustice et al. (1999) presented the concept of a universal information appliance (UIA), a device capable of dynamically hosting tailored interfaces to the pervasive computing environment. The paper extends this concept by allowing the user to change, modify or improve the tailored interfaces available. This will enable an individual to dynamically create a user interface on the fly and to use it to interact with myriad devices. Alternatively, users will be able to create, also on the fly, mobile agent-like entities that will roam around the network to obtain specified data for the individual. Interactions between multiple UIAs will also be possible. Thus, we can envisage a scenario where an individual will create an agent-like entity tasked to roam around the network, delegating work to different devices, to achieve a desired goal.
Design and analysis of data structures for dynamic trees
Authors: Robert E. Tarjan
Venue:  (2006)

The dynamic trees problem is that of maintaining a forest that changes over time through edge insertions and deletions. We can associate data with vertices or edges and manipulate this data, individually or in bulk, with operations that deal with whole paths or trees. Efficient solutions to this problem have numerous applications, particularly in algorithms for network flows and dynamic graphs in general. Several data structures capable of logarithmic-time dynamic tree operations have been proposed. The first was Sleator and Tarjan's ST-tree, which represents a partition of the tree into paths. Although reasonably fast in practice, adapting ST-trees to different applications is nontrivial. Frederickson's topology trees, Alstrup et al.'s top trees, and Acar et al.'s RC-trees are based on tree contractions: they progressively combine vertices or edges to obtain a hierarchical representation of the tree. This approach is more flexible in theory, but all known implementations assume the trees have bounded degree; arbitrary trees are supported only after ternarization. This thesis shows how these two approaches can be combined (with very little overhead) to produce a data structure that is at least as generic as any other, very easy to adapt, and as practical as ST-trees. It can be seen as a self-adjusting implementation of top trees and provides a logarithmic bound per operation in the amortized sense. We also discuss a pure contraction-based implementation of top trees, which is more involved but guarantees a logarithmic bound in the worst case. Finally, an experimental evaluation of these two data structures, including a comparison with previous methods, is presented.
Unified and Personalized Messaging to Support E-Learning
Authors: Keith Mitchell, Nicholas J. P. Race, Duncan McCaffery, Mark Bryson, Zhen Cai
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

The University of Lancaster is a campus based educational institution with over 10,000 members of staff and students on campus during a typical day. The University is currently investigating the use of mobile and smart devices as a platform for delivering mobile learning services and administrative information on a personalized basis. This paper describes two current active areas of development. First, we present an SMS text messaging extension to our Virtual Learning environment (VLE) and describe how this is used to provide personalized messaging. Second, we present our work on a Bluetooth based communications service, named BlueZone, which we use to complement SMS text messaging to offer an alternative communications platform to students. The combination of these technologies provides a unified and cost effective delivery mechanism for communicating with University undergraduates on a large scale.
A framework for managing optimization models for supply chain software agents
Authors: Jae Kyu Lee, Yong Sik Chang
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

As third party logistic services become popular, the role of software agents increases in importance in terms of the logistics scheduling of buyers and sellers. To support many models in such a portal site focused on logistics, automatic formulation and modification of optimization models embedded in the multiple software agents is necessary. The stakeholders like manufacturers and third party deliverers have their objectives and constraints in terms of delivery requirements and resource limitations. Since a variety of situations require many combinations of models, it is not easy to prepare all the necessary models in advance. To resolve this issue, we propose the primitive model approach which identifies a base model first and then modifies it to meet the modeling requirements. A prototype architecture AGENT-OPT2 is designed with the capability of rule-based model modification. This framework is demonstrated with the cooperative delivery scheduling problems.
Image Retrieval Based on Improved Entropy and Moments
Authors: Junding Sun
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Entropy and moments have been widely used in image retrieval. However, perceptually dissimilar color histograms have similar entropy and moments by traditional methods if they have similar probability distribution. In order to remove such influence, three improved methods, histogram sorting, histogram area and the combination of the above two, are presented in this paper. Experiments show that the proposed algorithms are more effective in image retrieval than the traditional methods.
Decision-making support for maritime business
Authors: Jonathan Himoff
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

A near real time multi-agent based system for scheduling ocean fleets has been developed. The ocean scheduling problem has relatively low numbers of cargos and vessels to deal with but it is highly complex in terms of constraints and numbers of options. It also has a high rate of events affecting the schedule and different fleet operators have differing goals for the parameters of their schedule. This variability is dealt with by storing knowledge of this in ontology.
Recommendation algorithm combining the user-based classified regression and the item-based filtering
Authors: Yu Chuan, Xu Jieping, Du Xiaoyong
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

With the expansion of the Internet services, providing personalized product recommendations has become one of the most important ways to attract customers. Especially, collaborative recommender systems have achieved widespread success on the web. Information of products is recommended to the users based on their nearest "neighbors" who have similar interests. It is widely known that there is a sparsity problem in such systems. However, according to our research, there are other problems: one is that the typical collaborative algorithm loses some important parameter when it predicts the ratings, because there might be a strong similarity between the users who give very different ratings. Another is that the classification information of resources is not used. To solve these problems, we have proposed a recommendation algorithm combining the user-based classified regression and the item-based filtering. The experiment results show that performance is improved after applying the new algorithm.
Machine Creation
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2006)

Based in Slovenia, cover artist Bogdan Soban prefers to work with generative art instead of computer-aided art because of the former's unique possibility to express the unknown through mathematical formulas. Soban's images are the result of autonomous processes supported by computer programs he developed himself in Visual Basic.
A New Scheme for Nucleotide Sequence Signature Extraction
Authors: Sung-Soo Kim, Chan-Hee Lee, Keon Myung Lee, Sung-Duk Lee
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

In this paper, we have proposed a new method that extracts a set of signatures from different nucleotide groups via measuring the distances between the groups. The proposed method not only extracts automatically the signatures of different sizes via constraint relaxation, but also provides the locations of signatures in a sequence while it measures the relative distance between the groups, which provides a convenience for understanding the information on nucleotide. The performance of the proposed method is demonstrated through simulations and analysis.
Compact finite difference method for integro-differential equations
Authors: Jichao Zhao, Robert M. Corless
Venue: Applied Mathematics and Computation (2006)

In this paper, we give sixth order compact finite difference formula for second order integro-differential equations (IDE) with different boundary conditions, and both of error estimates and numerical experiments confirm our compact finite difference method can get fifth order of accuracy. We also adjust compact finite difference method for first order IDE and a system of IDE and give numerical experiments for them. Our algorithm even can solve nonlinear IDE and unsplit kernel of IDE. The most advantages of compact finite difference method for IDE are that it obtains high order of accuracy, while the time complexity to solve the matrix equations after we use compact finite difference method on IDE is O(N), and it can solve very general case of IDE.