ppxscal/embedding_network huggingface dataset:
Determination of Stress Strain State Components of Butt Welded Joint with Mild Interlayer Subjected to Elasto-Plastic Tension
Authors: Algis Bražėnas, Dainius Vaičiulis, Vytautas Kleiza
Venue: Informatica (2006)

Determination of stress strain state components of butt welded joint with a mild interlayer at elasto-plastic tension is presented in this paper. Function of normal transverse stresses distribution on the thickness of mild interlayer and equations for determination of the stress intensity maximum value in hard metal at elasto-plastic deforming are proposed. The longitudinal stresses of mild and hard metals at elasto-plastic loading are determined from their integral equilibrium condition to mean value of external load by estimating equality of hard and mild metal longitudinal strains on their contact plane. Algorithm of stress strain state components calculation in separate zones of this model is presented. The strength of butt welded joint with a mild interlayer and longitudinal strain distribution at static and cyclic elasto-plastic loading on its surface calculated analytically is verified by the results of experimental investigations.
MRF Agent Based Segmentation: Application to MRI Brain Scans
Authors: B. Scherrer, M. Dojat, F. Forbes, C. Garbay
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

The Markov Random Field (MRF) probabilistic framework is classically introduced for a robust segmentation of Magnetic Resonance Imaging (MRI) brain scans. Most MRF approaches handle tissues segmentation via global model estimation. Structure segmentation is then carried out as a separate task. We propose in this paper to consider MRF segmentation of tissues and structures as two local and cooperative procedures immersed in a multiagent framework. Tissue segmentation is performed by partitionning the volume in subvolumes where agents estimate local MRF models in cooperation with their neighbours to ensure consistency of local models. These models better reflect local intensity distributions. Structure segmentation is performed via dynamically localized agents that integrate anatomical spatial constraints provided by an apriori fuzzy description of brain anatomy. Structure segmentation is not reduced to a postprocessing step: rather, structure agents cooperate with tissue agents to render models gradually more accurate. We report several experiments that illustrate the working of our multiagent framework. The evaluation was performed using both phantoms and real 3T brain scans and showed a robustness to nonuniformity and noise together with a low computational time. This MRF agent based approach appears as a very promising new tool for complex image segmentation.
Crossword Puzzles as a Constraint Problem
Authors: Anbulagan, Adi Botea
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

We present new results in crossword composition, showing that our program significantly outperforms previous successful techniques in the literature. We emphasize phase transition phenomena, and identify classes of hard problems. Phase transition is shown to occur when varying problem parameters, such as the dictionary size and the number of blocked cells on a grid, of large-size realistic problems.
Improving scalability and fault tolerance in an application management infrastructure
Authors: Nikolay Topilski, Jeannie Albrecht, Amin Vahdat
Venue: First USENIX Workshop on Large-Scale Computing (2008)

This paper explores the challenges associated with distributed application management in large-scale computing environments. In particular, we investigate several techniques for extending Plush, an existing distributed application management framework, to provide improved scalability and fault tolerance without sacrificing performance. One of the main limitations of Plush is the structure of the underlying communication fabric. We explain how we incorporated the use of an overlay tree provided by Mace, a toolkit that simplifies the implementation of overlay networks, in place of the existing communication subsystem in Plush to improve robustness and scalability.
Reconfigurable Modular Computer Networks for Spacecraft On-Board Processing
Authors: D. A. Rennels
Venue: Computer (1978)

Standardized fault-tolerant microcomputers in a reconfigurable distributed network promise to meet spacecraft reliability requirements at low cost.
Improving the Accessibility of Wikis
Authors: C. Taras, O. Siemoneit, N. Weißer, M. Rotard, T. Ertl
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

During the last years wikis have become important information portals. Nevertheless, research in wiki accessibility is an often neglected topic. This paper takes a basic analytical and systematic step inside this new and complex area, explores the peculiarities, possibilities and limitations of wiki accessibility. Wikis give rise to certain accessibility limitations but also do offer new ways and concepts to improve accessibility. We present basic concepts and extensions to the wiki markup that are to our minds inevitable for improving the accessibility of wikis. It is pointed out, that wiki accessibility is not something totally new but mostly a complex conjunction of yet separated classical discussions. However there are also wiki specific accessibility aspects.
The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm
Authors: Armand M. Makowski
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

We consider an ant-based algorithm for binary bridge selection, and analyze its convergence properties with the help of techniques from the theory of stochastic approximations.
A Fast Duplication Checking Algorithm for Forward Reasoning Engines
Authors: Takahiro Koh, Yuichi Goto, Jingde Cheng
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

A forward reasoning engine capable of relevant reasoning is an indispensable component in many advanced knowledge-based systems with purposes of discovery or prediction. Any forward reasoning engine has to deal with duplication checking of intermediate results that is the most time-consuming process in forward reasoning. Therefore, to decrease execution time of forward reasoning engines is a crucial issue for their successful applications. This paper presents a fast algorithm for duplication checking process in forward reasoning engines, analyzes its time and space complexities, and shows its effectiveness by some experimental results.
Texture Image Segmentation Based on Improved Wavelet Neural Network
Authors: Deng-Chao Feng, Zhao-Xuan Yang, Xiao-Jun Qiao
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper, a texture image segmentation algorithm based on improved wavelet neural network is proposed.This algorithm can overcome shortcomings of traditional threshold segmentation techonologies. By using texture features of images, a series of fractal texture feature parameters which will be taken as input layer factors of wavelet network are created by this algorithm. Then, the wavelet neural network is trained with self-adaptive pheromone volatilization mechanism and dynamic heuristic search strategy of improved ant colony algorithm. Finally, the trained wavelet neural network is taken as the classifier of image pixel to realize segmentation of texture images. Simulation experiment shows that, improved algorithm could realize self-adaptive segmentation based on different texture features of images and it is robuster. However, further researches on methods of improving convergence speed of this algorithm and objective criteria for assessing whether texture images have been segmented successfully or not are needed.
Floppy Disk Data Transfer Techniques
Authors: Trevor Marshall, John Attikiouzel
Venue: IEEE Micro (1983)

Many microcomputer systems use a DMA controller between the floppy disk controller and the CPU. This additional hardware may not always be necessary.
Experimental and numerical investigations in the near-burner region of a versatile multi-fuel burner
Authors: N. Orfanoudakis, A. Hatziapostolou, K. Krallis, K. Sardi, N. Vlachakis, St. A. Mavromatis, V. D. Tsoukalas
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

An experimental and numerical investigation on the effect of swirl on the motion of coal particles in the near-burner region of a multi-fuel swirl-stabilised laboratory burner of total thermal input of 100 kW, has been performed. The burner was designed as a scale model of a 10 MW coal burner operating in a cement rotary kiln, produced flames of different aerodynamic characteristics and was able to burn a combination of gaseous, liquid and pulverised solid fuels. Temperature and Laser Doppler measurements of all three velocity components obtained in isothermal and reacting single and multiphase flows as a function of swirl number in the range of 0.45 to 0.9 confirmed the ability of the burner to produce close-to-industrial conditions making it a powerful tool in the field of combustion research. In detail, the velocity measurements showed that the flow field was axisymmetric and an internal recirculation zone (IRZ) in the shape of a toroidal vortex was formed around the centreline for swirl numbers of at least 0.65. A 60% increase in the swirl number, from 0.65 to 0.9, resulted in a 30% widening of the IRZ. Solid particle measurements in the same configuration revealed that the width of the zone where coal particles recirculate is by 20% larger than that formed in the single phase case and that most of the coal particles are centrifuged away from the IRZ, particularly at high swirl numbers. A numerical investigation on the effect of the swirl number on the fluid and particle motion has also been performed. The flow field was modeled as 2D axisymmetric and results were obtained with both the RNG and k-ε turbulence models and results were shown to be in good agreement with the measurements even at the high swirl number, when the RMG model was used. Lagrangian tracking of coal particles in the range of 1 to 150 &mu;m was also performed by as a function of swirl number. The calculations revealed that particles of diameter larger than about 20 &mu;m are centrifuged away from the IRZ in accordance to the measurements while particles larger than 100 &mu;m, due to their high inertia remain on the IRZ boundary and are neither centrifuged nor entrained inside the recirculation zone, In accordance with the measurements, the calculations also showed that the effect of centrifuging is decreased when the swirl number of reduced.
Translation dual of a semifield
Authors: Guglielmo Lunardon, Giuseppe Marino, Olga Polverino, Rocco Trombetti
Venue: Journal of Combinatorial Theory Series A (2008)

In this paper we obtain a new description of the translation dual of a semifield introduced in [G. Lunardon, Translation ovoids, J. Geom. 76 (2003) 200-215]. Using such a description we are able to prove that a semifield and its translation dual have nuclei of the same order. Combining the Knuth cubical array and the translation dual, we give an alternate description of the chain of twelve semifields in the table of [S. Ball, G.L. Ebert, M. Lavrauw, A geometric construction of finite semifields, J. Algebra 311 (2007) 117-129].
Predicting the success of B2B e-commerce in small and medium enterprises: based on consistent fuzzy preference relation
Authors: Tien-Chin Wang, Ying-Ling Lin
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

This investigation establishes an analytical hierarchy framework to help SMEs predicting implementation success as well as identifying the actions necessary before implementing B2B e-commerce to increase e-commerce initiative feasibility. The consistent fuzzy preference relation is used to improve decision making consistency and effectiveness. A case study involving six influences solicited from a Taiwanese steel company is used to illustrate the feasibility and effectiveness of the proposed approach. The analytical results show that the three most influential factors are management support, industry characteristics and government policies; meanwhile, the three least influential factors are organizational culture, IT integration and firm size.
Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks
Authors: Areej Zuhily, Alan Burns
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

An exact schedulability test of Accumulatively Monotonic (AM) multiframe tasks executing on a uniprocessor according to the fixed priority scheduling scheme is presented in this paper. The test is given as an analysis of the worst case response time of each AM multiframe task. This analysis is given in two stages, firstly we give the basic formula of the worst case response time of an AM multiframe task. Secondly, we extend this formula to include blocking time. An evaluation of this analysis is given as a comparison between this exact schedulability analysis and the most recent published, but non-optimal, schedulability analysis.
Individualised Product Portrayals in the Usability of a 3D Embodied Conversational Agent in an eBanking Scenario
Authors: Alexandra Matthews, Nicholas Anderson, James Anderson, Mervyn Jack
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

A cohort of 65 participants interacted with an extrovert male Embodied Conversational Agent (ECA) in four individualised product portrayals. Results suggest that customers respond more positively to portrayals by ECAs of savings account product offers in contrast to investment account product offers, both in terms of usability and relevance.
Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks
Authors: Kayhan Erciyes, Deniz Ozsoyeller, Orhan Dagdeviren
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

We propose two algorithms to form spanning trees in sensor networks. The first algorithm forms hierarchical clusters of spanning trees with a given root, the sink. All of the nodes in the sensor network are then classified iteratively as subroot, intermediate or leaf nodes. At the end of this phase, the local spanning trees are formed, each having a unique subroot (clusterhead) node. The communication and data aggregation towards the sink by an ordinary node then is accomplished by sending data to the local subroot which routes data towards the sink. A modified version of the first algorithm is also provided which ensures that the obtained tree is a breadth-first search tree where a node can modify its parent to yield shorter distances to the root. Once the sub-spanning trees in the clusters are formed, a communication architecture such as a ring can be formed among the subroots. This hybrid architecture which provides co-existing spanning trees within clusters yields the necessary foundation for a two-level communication protocol in a sensor network as well as providing a structure for a higher level abstraction such as the ¿ synchronizer where communication between the clusters is performed using the ring similar to an ¿ synchronizer and the intra cluster communication is accomplished using the sub-spanning trees as in the β synchronizers. We discuss the model along with the algorithms, compare them and comment on their performances.
Feature relational mapping for remote sensing images using directional edge analytical models
Authors: Junfeng Gu
Venue:  (2007)

An integrated approach of feature analysis&mdash;Directional Edge Analytical Model (DEAM) is presented. Remote sensing and image processing with feature extraction are significant for collecting information. Many different techniques, invariant to different types of geometric transformations, contextual conditions and task demands, have been developed for recognizing features of objects. Most of current feature analysis has emphasized non-remote objects and has lacked handling with the properties of remote sensing images. In addition, Relational structures are particularly suitable for representing complex features and for providing matching solutions; this area of research is still in very early stage. Using directional edges as descriptors for relational features, DEAM provides supervised models with matching procedures. Novel methods with adaptive threshold detectors and directional descriptors are designed according to the properties of remote sensing images. DEAM analyzes the connection of the functional edges in an object, and then it builds the analytical model by feature descriptors. It utilizes "many to many relations" with "relation of relations" to reduce the redundancy and to increase the accuracy of a training set. After feature relational mapping, the corresponding descriptors between the model and the target will assist researchers in identifying the object. DEAM demonstrate superiority in quantifying structural relationships and in normalized features that are desired for many analytical applications. 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
Security weakness in an authenticated group key agreement protocol in two rounds
Authors: Jung Yeon Hwang, Kyu Young Choi, Dong Hoon Lee
Venue: Computer Communications (2008)

Dutta and Barua recently proposed an efficient authenticated group key agreement protocol for dynamic membership. To reduce computation overhead, the protocol makes use of a simplified authentication mechanism such that only two neighbors of a participant check if a message is originated from the participant. In this paper, we show that the authenticated group key agreement protocol has some security breaches caused by the restrictive authentication. In addition, we present a simple method to fix the security breaches and prove its security under the standard assumptions.
Towards a Complex Automata Framework for Multi-scale Modeling: Formalism and the Scale Separation Map
Authors: Alfons G. Hoekstra, Eric Lorenz, Jean-Luc Falcone, Bastien Chopard
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Complex Automata were recently proposed as a paradigm to model multi-scale complex systems. The concept is formalized and the scale separation map is further investigated in relation with its capability to specify the components of Complex Automata. Five classes of scale separation are identified, each potentially giving rise to a specific multi-scale modeling paradigm. A number of canonical examples are briefly discussed.
Measurement Manipulation and Space Selection in Network Coordinates
Authors: Cristian Lumezanu, Neil Spring
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate systems have been evaluated solely on data sets built by their authors from measurements gathered over large periods of time. Although they show good prediction results, it is unclear whether the accuracy is the result of the system design properties or is more connected to the characteristics of the data sets. In this paper, we revisit a simple question: how do the features of the embedding space and the inherent attributes of the data sets interact in producing good embeddings? We adapt the Vivaldi algorithm to use Hyperbolic space for embedding and evaluate both Euclidean and Hyperbolic Vivaldi on seven sets of real-world latencies. Our results show that node filtering and latency distributions can significantly influence the accuracy of the predictions. For example, although Euclidean Vivaldi performs well on data sets that were chosen, constructed and filtered by the designers of the algorithm, its performance and robustness decrease considerably when run on third party data sets that were not filtered a priori. Our results offer important insight into designing and building coordinate systems that are both robust and accurate in Internet-like environments.
Generating Social Network Features for Link-Based Classification
Authors: Jun Karamon, Yutaka Matsuo, Hikaru Yamamoto, Mitsuru Ishizuka
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

There have been numerous attempts at the aggregation of attributes for relational data mining. Recently, an increasing number of studies have been undertaken to process social network data, partly because of the fact that so much social network data has become available. Among the various tasks in link mining, a popular task is link-based classification, by which samples are classified using the relations or links that are present among them. On the other hand, we sometimes employ traditional analytical methods in the field of social network analysis using e.g., centrality measures, structural holes, and network clustering. Through this study, we seek to bridge the gap between the aggregated features from the network data and traditional indices used in social network analysis. The notable feature of our algorithm is the ability to invent several indices that are well studied in sociology. We first define general operators that are applicable to an adjacent network. Then the combinations of the operators generate new features, some of which correspond to traditional indices, and others which are considered to be new. We apply our method for classification to two different datasets, thereby demonstrating the effectiveness of our approach.
Detailed 3D Reconstruction of Large-Scale Heritage Sites with Integrated Techniques
Authors: Sabry F. El-Hakim, J. -Angelo Beraldin, Michel Picard, Guy Godin
Venue: IEEE Computer Graphics and Applications (2004)

Selecting the most effective technique for modeling large-scale heritage sites is not always obvious. This article discusses each technique and points out advantages and disadvantages. The article presents the authors' own approach, which is an integration of several technologies and is based on the experience they gained over more than a decade for accurately and completely modeling heritage monuments and sites.