ppxscal/embedding_network huggingface dataset:
Numerical study of a bonded steel and concrete composite beam
Authors: Guozhong Zhao, Alex Li
Venue: Computers and Structures (2008)

In traditional steel-concrete composite beam, the connection between steel beam and concrete slab is ensured by steel shear studs. This paper studies the nonlinear mechanical behavior and failure process of a bonded steel-concrete composite beam by using finite element method. A three-dimensional finite element (FE) model has been developed in this work. The results indicate that there are three major reasons for failure of the composite beam: cracking of the concrete by the local tensile stress, crushing of the concrete by the compressive stress and extensive yielding of the steel beam under the global bending moment.
ANN-based software analyzer design and implementation in processes of microbial ecology
Authors: Svetla Vassileva, Bonka Tzvetkova
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

Present work is oriented to study of processes of microbial ecology by developing and implementing artificial neural networks (ANN)-based software analyzers. Microbial ecology investigates the function of microorganisms in the environment. Towards understanding the role of microorganisms in important ecosystem processes, one example is considered. The presented example is focused on continuous yeasts growth prediction by the developed software analyzer, which helps to discover the influence of initial formaldehyde concentrations on the continuous cell growth, correlated with the protein-synthesizing ability (A,[h-1]) of yeasts strain Candida didensii 74-10 at two different dilution rates (D,[h-1]). The Levenberg-Marquardt optimization technique has been used to upgrade the network by minimizing the sum square error (SSE). The performance of the network with two hidden layers for predicting cell mass and protein synthesizing ability is found to be very effective.
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg
Authors: Benjamin Steinberg
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

Recently, Almeida, Margolis, Volkov and I have applied matrix representation theory [1] to give a simpler proof of results of Péladeau [4] and Weil [5] concerning marked products with counter. Eilenberg's theorem characterizing languages recognized by p-groups [2] is a special case of these results. In these proceedings I will give a simple proof of Eilenberg's Theorem based on representation theory that I came up with for a graduate course. The ideas are similar to those used in [1], which I presented during the conference.
An Investigation into Small World Phenomenon in Engineering Informatics
Authors: Zhengxu Zhao, Jinsheng Fan
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Product information is complex and discrete in terms of design methods and manufacturing processes, its long term retention has for time been a great challenge. This paper presents an initial investigation into the Small World Phenomenon within product information with an emphasis on Computer-Aided Design (CAD) data and its generating systems. The objective is to construct a networking model in the notion of Six Degrees Separation and thereafter to produce useful findings for future reference in information organization. It is expected that this model will be an essence for effective CAD data translation, exchange, index and migration and for helping to deal with the key problems in long term retention of product data
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Authors: Ian Hodkinson, Angelo Montanari, Guido Sciavicco
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively complete interval logic language called CDT, based on binary operators, which has many potential applications and a strong theoretical interest. Many very natural questions about CDT and its fragments, such as (non-)finite axiomatizability and (un-)decidability, are still open (as a matter of fact, only a few undecidability results, including the undecidability of CDT, are known). In this paper, we answer most of these questions, showing that almost all fragments of CDT, containing at least one binary operator, are neither finitely axiomatizable with standard rules nor decidable. A few cases remain open.
Gyro Stabilized System Based on Auto-Disturbance Rejection Controller
Authors: Qing Zhang, Zhenfan Tan, Ying Liang
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

This paper presents a nonlinear controller which is called auto-disturbance rejection controller (ADRC) applied to a gyro stabilized system. The mathematical model of the servo loop of the gyro stabilized system is discussed. The basic theory of the ADRC is introduced. According to the mathematical model, the parameters of ADRC for the servo loop is designed. The results of simulation show that not only the dynamic and static characteristics of the system can satisfy the performance requirements, but also the control effect of ARDC is better than the effect of the classical PID controller.
Effective Spatial Characterization System Using Density-Based Clustering
Authors: Chan-Min Ahn, Jae-Hyun You, Ju-Hong Lee, Deok-Hwan Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Previous spatial characterization methods does not analyze well spatial regions for a given query since it only focus on characterization for user's pre-selected area and without consideration of spatial density. Consequently, the effectiveness of characterization knowledge is decreased in these methods. In this paper, we propose a new hybrid spatial characterization system combining the density-based clustering module which consists of the attribute removal generalization and the concept hierarchy generalization. The proposed method can generate characteristic rule and apply density-based clustering to enhance the effectiveness of generated rules.
The complexity of CTBT verification. Taking noble gas monitoring as an example
Authors: Martin B. Kalinowski, Andreas Becker
Venue: Complexity (2008)

Verification of the Comprehensive Nuclear-Test-Ban Treaty is a complex undertaking. A monitoring system comprising a global network of 321 seismic, hydroacoustic, infrasound and radionuclide stations is used to detect signals that could indicate a possible nuclear explosion. This system daily sends more than 10 GB of raw data to the Vienna based International Data Centre for further processing and analysis to answer a simple question: have any indications for a possible nuclear explosion been sensed? We will focus on the 40 stations in charge for global radioxenon monitoring and discuss the complexity of solving the nuclear source attribution problem. &copy; 2008 Wiley Periodicals, Inc. Complexity, 2008. The views expressed herein are those of the authors and do not necessarily reflect the views of the CTBTO Preparatory Commission.
Mapping theoretical and practical issues in the relationship between ICTs and Africa's socioeconomic development
Authors: Levi Obijiofor
Venue: Telematics and Informatics (2009)

The relationship between new information and communication technologies (ICTs) and socioeconomic development has remained largely a subject of academic debate. While some researchers believe the new technologies represent the tonic that Africa needs to boost economic growth, other researchers are less sanguine. This paper maps out the debate in the literature, including perceived and real impact of new technologies on Africa's social and economic development. The paper examines also the current and emerging issues relating to new technologies' adoption and use in Africa, as well as the problems associated with the technologies in developing African countries. Based on evidence drawn from successful diffusion and use of new technologies at micro and macro levels in Africa, Southeast Asia and Canada, the author takes the position that there is a strong link between uptake of new technologies and the socioeconomic growth and development of different countries and communities. The issues examined in this paper provide a research-based framework for the analysis of the impact of ICTs on the socioeconomic development of Africa.
No-regret learning and a mechanism for distributed multiagent planning
Authors: Jan-P. Calliess, Geoffrey J. Gordon
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft constraints on resource consumption. (Resources may be real or fictitious, the latter introduced as a tool for factoring the problem). A key idea is to recast the distributed planning problem as learning in a repeated game between the original agents and a newly introduced group of adversarial agents who influence prices for the resources. The adversarial agents benefit from arbitrage: that is, their incentive is to uncover violations of the resource usage constraints and, by selfishly adjusting prices, encourage the original agents to avoid plans that cause such violations. If all agents employ no-regret learning algorithms in the course of this repeated interaction, we are able to show that our mechanism can achieve design goals such as social optimality (efficiency), budget balance, and Nash-equilibrium convergence to within an error which approaches zero as the agents gain experience. In particular, the agents' average plans converge to a socially optimal solution for the original planning task. We present experiments in a simulated network routing domain demonstrating our method's ability to reliably generate sound plans.
The Role of Entropy in Intuitionistic Fuzzy Contrast Enhancement
Authors: Ioannis K. Vlachos, George D. Sergiadis
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In this paper we study the impact of selecting different entropy measures in the framework of intuitionistic fuzzy image processing and especially in the process of intuitionistic fuzzification of images. Different notions of entropy characterized by different properties are reviewed and their behavior is thoroughly studied under the scope of performing contrast enhancement. Finally, experimental results using gray-scale images reveal the characteristics of the aforementioned measures.
TOPSU - RDM a simulation platform for online railway delay management
Authors: Andre Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Delays in a railway network is a common problem that railway companies face in their daily operations. When a train gets delayed, it may either be beneficial to let a connecting train wait so that passengers in the delayed train do not miss their connection, or it may be beneficial to let the connecting train depart on time to avoid further delays. These decisions naturally depend on the global structure of the network and on the schedule. The railway delay management (RDM) problem (in a broad sense) is to decide which trains have to wait for connecting trains and which trains have to depart on time. The offline version (i.e. when all delays are known in advance) is already NP-hard for very special networks. In this paper we show that the online railway delay management (ORDM) problem is PSPACE-hard, and we present TOPSU -- RDM, a simulation platform for evaluating and comparing different heuristics for the ORDM problem with stochastic delays. Our novel approach is to separate the actual simulation and the program that implements the decision making policy, thus enabling implementations of different heuristics to "compete" on the same instances and delay distributions. For RDM and other logistic planning processes, it is our goal to bridge the gap between theoretical models, which are accessible to theoretical analysis, but often too far away from practice, and the methods which are used in practice today, whose performance is almost impossible to measure.
Asymptotically Optimal Hitting Sets Against Polynomials
Authors: Markus Bläser, Moritz Hardt, David Steurer
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Our main result is an efficient construction of a hitting set generator against the class of polynomials of degree di in the i-th variable. The seed length of this generator is logD + Ō(log1/2D). Here, logD = &Sigma;i log(di + 1) is a lower bound on the seed length of any hitting set generator against this class. Our construction is the first to achieve asymptotically optimal seed length for every choice of the parameters di. In fact, we present a nearly linear time construction with this asymptotic guarantee. Furthermore, our results extend to classes of polynomials parameterized by upper bounds on the number of nonzero terms in each variable. Underlying our constructions is a general and novel framework that exploits the product structure common to the classes of polynomials we consider. This framework allows us to obtain efficient and asymptotically optimal hitting set generators from primitives that need not be optimal or efficient by themselves. As our main corollary, we obtain the first blackbox polynomial identity tests with an asymptotically optimal randomness consumption.
Non-linear systems of interfaces of statistical mechanics models with a fixed intermediate region
Authors: Jun Wang, Bingtuan Wang
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

We consider the fluctuations of the two interfaces' problems of the one-dimensional statistical mechanics models. The relations of the two random interfaces are constructed by assuming that there is a specified value of the large area in the intermediate region of the two random interfaces, and the two random interfaces have fixed endpoints. When β large enough, we discuss the statistical limiting properties of the two random interfaces of the model.
A Weighted Routing Protocol Using Grey Relational Analysis for Wireless Ad Hoc Networks
Authors: Hung-Chi Chu, Yi-Ting Hsu, Yong-Hsun Lai
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Issues relating to routing protocols are important in wireless ad hoc network research. In this paper we present a weighted ad-hoc routing protocol that exhibit low cost and high efficiency. In our method, important factors including hop count, end-to-end delays, and nodes' residual energy are considered. Grey Relational Analysis is utilized for discovering the importance of these factors and to decide their weighted values. Simulation result shows that the performance of our method is better than traditional wireless ad hoc network routing protocols.
Multiplying Concept Sources for Graph Modeling
Authors: Loic Maisonnasse, Eric Gaussier, Jean Pierre Chevallet
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The main idea in this paper is to incorporate medical knowledge in the language modeling approach to information retrieval (IR). Our model makes use of the textual part of ImageCLEFmed corpus and of the medical knowledge as found in the Unified Medical Language System (UMLS) knowledge sources. The use of UMLS allows us to create a conceptual representation of each sentence in the corpus. We use these representations to create a graph model for each document. As in the standard language modeling approach, we evaluate the probability that a document graph model generates the query graph. Graphs are created from medical texts and queries, and are built for different languages, with different methods. After developing the graph model, we present our tests, which involve mixing different concepts sources (i.e. languages and methods) for the matching of the query and text graphs. Results show that using language model on concepts provides good results in IR. Multiplying the concept sources further improves the results. Lastly, using relations between concepts (provided by the graphs under consideration) improves results when only few conceptual sources are used to analyze the query.
Control and self-localization of an omni-directional mobile robot
Authors: S. Ziaei-Rad, F. Janabi-Sharifi, M. Daneshpanah, A. Abdollahi, H. Ostadi, H. Samani
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Omni-directional mobile robots are becoming popular for many applications especially in soccer playing robots. Effective control and self-localization of omni-directional mobile robots constitute important and challenging issues. In this work, a simplified model of the system has been derived for fast tuning of the control system parameters. In particular, strategies for fast tuning of PID/PD coefficients for position and orientation control are devised. A vision-based self-localization and the conventional odometry systems have been fused for robust self-localization. The methods have been tested in the RoboCup competition field using three Persia middle size omni-directional robots.
SimCon - a simulation and visualization environment for overlay networks and large-scale applications
Authors: Markus Esch, Jean Botev, Hermann Schloss, Alexander Höhfeld, Ingo Scholtes, Benjamin Zech
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

A substantial number of massive large-scale applications require scalable underlying network topologies. Nowadays structured Peer-to-Peer overlay networks meet these requirements very well. But there is still a need to decide which of these overlay networks is most suitable for providing the best possible performance for a certain application. This paper describes SimCon - a simulation environment for overlay networks and large-scale applications. SimCon allows the comparison of different overlay networks with respect to predefined metrics derived from requirements of the considered application. This approach allows determining which overlay network meets the needs of a given application best, which in turn is a great support for developers of large-scale applications.
MSPI (Multi-Spectral Protection Infrastructure) System for Optimal Network Security
Authors: Si Choon Noh, Sang Yeob Na
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This research paper provides a diagnosis of characteristics and weaknesses of the structure of existing network security infrastructure, and recommends a MSPI (multi-spectral protection infrastructure) as a measure for correcting weaknesses. This paper conducted research into improved effective model from the infrastructure configuration aspect. The improvement on the protection infrastructure is assured by letting the failovering mechanism operate upon the entire structure through the structural design and the implementation of functions. MSPI filters unnecessary mail at the gateway stage to reduce the server loads. As a result, number of transmission accumulation decreases due to the reduction in the CPU load on the viruswall and increase in virus treatment rate. The proposed method reduces the system overload rating due to trouble packets and improves the status of connection by polling trap and the transport factor by ping packet.
Computerized Classification of Mammary Gland Patterns in Whole Breast Ultrasound Images
Authors: Yuji Ikedo, Takako Morita, Daisuke Fukuoka, Takeshi Hara, Hiroshi Fujita, Etsuo Takada, Tokiko Endo
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Several whole breast ultrasound (US) scanners have recently been developed for breast cancer screening. In ultrasonographic screening techniques that utilize scanners, assessment of the mammary gland pattern in US images by a radiologist is required. We developed a method of mammary gland analysis to automatically classify whole breast US images into three categories: mottled pattern (MP), intermediate pattern (IP), and atrophic pattern (AP). Our database included 50 patients who underwent US of the entire breast, and they were classified as 12 MP, 24 IP, and 14 AP cases. First, we extracted a volume of interest (VOI) including mammary gland regions. Following this, we extracted image features, i.e., the average pixel value (APV), the number of small hypoechoic regions (SHR), and Haralick's texture features, from the VOI. Finally, a canonical discriminant analysis with APV, SHR, and four texture features was applied for classification of mammary gland patterns. The performance of this classification method was 82.0% (41/50). We found that it is possible to classify whole breast ultrasound images based on mammary gland patterns. The classification method can be applied to estimate the risk of breast cancer based on US images, and it could also be applied in computer-aided diagnosis (CAD) systems for the detection of ultrasonographic breast cancer.
Adapting a blowdown type wind tunnel for ground effect simulation tests
Authors: Richard Selescu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper shortly presents the main results of some researches regarding the adaptation of an intermittent (blowdown type) wind tunnel for testing models of terrestrial (road transportation) vehicles, (air) vehicles with ground effect, or operating in the ground proximity (the aircraft take-off running and lift-off), as well as for aircraft half models testing ("reflection-plane testing"). The new installation includes a large series of automatic systems (mechanical, measuring and actuating), which meet all the envisaged testing requirements. The advantage of this solution, with respect to a continuous closed (usually non-pressurized) wind tunnel adaptation, consists in much larger values of the test Reynolds number. So far, as we know, nowhere in the world the adaptation problem of a pressurized intermittent type wind tunnel (to aerodynamic tests with a correct ground effect simulation) has been considered. The main part of this adapting solution is the moving belt mechanical system (installed on the floor of the modified wind tunnel 3-D transonic test section), whose task is to ensure the elimination of the velocity non-uniformity effect, introduced by the boundary layer on the respective wind tunnel wall, without any irreversible alteration of the geometry and kinematics of the installation above.