ppxscal/embedding_network huggingface dataset:
DGRAM: A Delay Guaranteed Routing and MAC protocol for wireless sensor networks
Authors: Chilukuri Shanti, Anirudha Sahoo
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

This paper presents an integrated MAC and routing protocol called Delay Guaranteed Routing and MAC (DGRAM) for delay sensitive wireless sensor network (WSN) applications. DGRAM is a TDMA-based protocol designed to provide deterministic delay guarantee in an energy efficient manner. The design is based on slot reuse to reduce the latency of a node in accessing the medium, while ensuring contention free medium access. The transmission and reception cycles of nodes are carefully computed so that data is transported from the source towards the sink while the nodes could sleep at the other times to conserve energy. Thus, routes of data packets are integrated into DGRAM. We provide a detailed design of time slot assignment and delay analysis of the protocol. One major advantage of DGRAM over other TDMA protocols is that the slot assignment is done in a fully distributed manner making the DGRAM network self-configuring. We have simulated DGRAM using ns2 simulator and compared the results with those of SMAC for a similar network. Simulation results show that the delay experienced by data packets is always less than the analytical delay bound for which the protocol is designed. As per simulation results, the average energy consumption does not change as the event rate changes, and is less than that of SMAC. This characteristic of DGRAM provides flexibility in choosing various operating parameters without having to worry about energy efficiency.
Microsoft SharePoint 2007 Technologies: Planning, Design and Implementation
Authors: Kevin Laahs, Emer McKenna, Veli-Matti Vanamo
Venue:  (2007)

Microsoft SharePoint 2007 Technologies: Planning, Design and Implementation provides an in-depth examination of the tasks involved in planning, designing and deploying SharePoint in your enterprise. SharePoint 2007 significantly extends the breadth of capabilities for end users, administrators, developers, and designers. The cutting-edge technology encompasses some major new functional areas such as Business Intelligence, Information LifeCycle Management, and Enterprise Content Management-all can be leveraged to satisfy many different business scenarios. SharePoint 2007 Technologies will provide readers with practical knowledge and techniques about integration of other 2007 products such as Office and Exchange Server, and readers will walk away with the ability to easily expose and leverage back-end business data and understand how it all joins together. Readers will further gain a solid appreciation of the architecture, administration, end user features, development, and integration opportunities offered by SharePoint 2007. The expertise of the author team in helping many large corporations deploy Microsoft technologies within their enterprises makes this book an invaluable tool to businesses of any size. * Complete guide to getting the most out of your SharePoint 2007 deployments* Critical techniques for system architects to design and deploy SharePoint 2007 Technologies* Features most important issues for day to day efficient management and usage* How to customize and extend your SharePoint environment for your own needs
Models as Arguments: An Approach to Computational Science Education
Authors: D. E. Stevenson
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Hardware and software technology have outpaced our ability to develop models and simulations that can utilize them. Furthermore, as models move further into unfamiliar territory, the issues of correctness becomes more difficult to assess. We propose extending classical argumentation structures as the basis for computational science education.
Identification of woven fabrics defects using image processing
Authors: Seyed Abbas Mirjalili, Esfandiyar Ekhtiyari, Saber Beitollahzadeh
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This paper reports identification of the defects in the woven fabrics, using image processing. These faults consist of end-break, mispick, double-end, double pick, oil stain and knots in the fabric. The faulty samples are scanned and processed using image processing. After eliminating the noises from the pictures, carried out by filtration, the pictures are introduced to neural network. In this research a 3-layer perceptron neural network has been utilized. The transform function is based on the function of Sigmoid. To train the network, 85 samples were used. Due to the increase of weights and the layers of neurons resulted from the increment in input, the process time will be added. This will result in a decrease in the calculation error.
Using Bibliographic Knowledge for Ranking in Scientific Publication Databases
Authors: Martin Vesely, Martin Rajman, Jean-Yves Le Meur
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Document ranking for scientific publications involves a variety of specialized resources (e.g. author or citation indexes) that are usually difficult to use within standard general purpose search engines that usually operate on large-scale heterogeneous document collections for which the required specialized resources are not always available for all the documents present in the collections. Integrating such resources into specialized information retrieval engines is therefore important to cope with community-specific user expectations that strongly influence the perception of relevance within the considered community. In this perspective, this paper extends the notion of ranking with various methods exploiting different types of bibliographic knowledge that represent a crucial resource for measuring the relevance of scientific publications. In our work, we experimentally evaluated the adequacy of two such ranking methods (one based on freshness, i.e. the publication date, and the other on a novel index, the download-Hirsch index, based on download frequencies) for information retrieval from the CERN scientific publication database in the domain of particle physics. Our experiments show that (i) the considered specialized ranking methods indeed represent promising candidates for extending the base line ranking (relying on the download frequency), as they both lead to fairly small search result overlaps; and (ii) that extending the base line ranking with the specialized ranking method based on freshness significantly improves the quality of the retrieval: 16.2% of relative increase for the Mean Reciprocal Rank (resp. 5.1% of relative increase for the Success@10, i.e. the estimated probability of finding at least one relevant document among the top ten retrieved) when a local rank sum is used for aggregation. We plan to further validate the presented results by carrying out additional experiments with the specialized ranking method based on the download-Hirsch index to further improve the performance of our aggregative approach.
Proceedings of the First International Workshop on Keyword Search on Structured Data
Venue: International Conference on Management of Data (2009)

Information search is an indispensable component of our lives. Web search engines are widely used for searching textual documents, images, and video. However, there are also vast collections of structured and semi-structured data both on the Web and in enterprises, such as relational databases, XML data, etc. Traditionally, to access these resources, a user must learn structured or semi-structured query languages, and must be able to access data schemas, which are most likely heterogeneous, complex, and fastevolving. To relieve web and scientific users from the learning curve and enable them to easily access structured and semi-structured data, there is a growing research interest to support keyword search on these data sources. The first International Workshop on Keyword Search on Structured Data (KEYS 2009) is held in Providence, Rhode Island, USA on 28th June, 2009, in conjunction with SIGMOD 2009 conference, and aims to encourage researchers from both academia and industry communities to discuss the opportunities and challenges in keyword search on (semi-)structured data, and to present the key issues and novel techniques in this area. In response to the call for papers, KEYS 2009 has attracted 25 submissions. The submissions are highly diversified, coming from Canada, China, Germany, Italy, Japan, Greece, Singapore, Sweden, Thailand, and USA, resulting in an international final program. All submissions were peer reviewed by three program committee members. The program committee selected 6 full research papers and 4 demo and poster papers for inclusion in the proceeding. The accepted papers covered a wide range of research topics and novel applications on keyword search on structured data.
On the Inability of Gathering by Asynchronous Mobile Robots with Initial Movements
Authors: Branislav Katreniak, Jana Katreniaková
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Consider a community of simple autonomous robots freely moving in the plane. The robots are decentralized, asynchronous, deterministic without the common coordination system, identities, direct communication, memory of the past, but with the ability to sense the positions of the other robots. Existing results show the inability of gathering in this model and solve the gathering problem in the model extended by the multiplicity detection capability. However, the previous results rely on the fact that the robots are intially not moving. We prove that the gathering problem is unsolvable in the model with initial movement vectors even with the multiplicity detection capability.
Lossy compression and curvelet thresholding for image denoising
Authors: G. Jagadeeswar Reddy, T. Jaya Chandra Prasad, M.N. Giri Prasad
Venue: International Journal of Information and Communication Technology (2009)

A new system of multi-scale transform, namely, the curvelets, was developed recently, which possess directional features and provides optimally sparse representation of objects with edges. In this paper a novice algorithm for image denoising based on lossy compression and curvelet thresholding (LCCT) is proposed. The results are compared with the results obtained from denoising methods like wavelets (DWT), lossy compression and wavelet thresholding (LCWT) and curvelets (DCvT). Standard deviation and PSNR are selected as performance metrics and it is shown that the proposed algorithm outperforms the existing algorithms.
Context Based Classification for Automatic Collaborative Learning Process Analysis
Authors: Yi-Chia Wang, Mahesh Joshi, Carolyn Rosé, Frank Fischer, Armin Weinberger, Karsten Stegmann
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

We present a publicly available tool called TagHelper that can be used to support the analysis of conversational data using automatic text classification technology. The contribution of this paper is to explore the limitations of the current simple approach to text processing employed by TagHelper tools with respect to identifying context-sensitive categories of conversational behavior. TagHelper can be downloaded from http://www.cs.cmu.edu/̋cprose/TagHelper.html.
Tzitzeica geometric functionals
Authors: Constantin Udriste, Vasile Arsinte
Venue: Proceedings of the 2nd WSEAS international conference on Multivariate analysis and its application in science and engineering (2009)

The subject of PDE constrained optimization has recently received a strong collaborative impulse by scientists from mathematics, physics, engineering, etc. This subject is focused on optimization methods, which take into account structures that arise from Lagrangians, PDEs and their discretizations. Our paper starts from an important Kuiper geometrical open problem whose solvability requires techniques from PDE constrained optimization: does a surface have a constrained minimal total Gaussian curvature? In this context, we analyse the following problems: the distance Lagrangian, the Monge-Ampère-Tzitzeica PDE, approximations of Tzitzeica Lagrangians, Tzitzeica surfaces with minimum total curvature, affine deviated Gauss curvature, and controlled least squares approximations of Tzitzeica surfaces.
Quality analysis of composed services through fault injection
Authors: Maria Grazia Fugini, Barbara Pernici, Filippo Ramoni
Venue: Information Systems Frontiers (2009)

Web service composition can be adopted to develop information systems through integration of services to obtain complex composed services. While interfaces of services are known at composition time, the quality of a composed service may depend on the ability of its component services to react to unforeseen situations, such as data quality problems and service coordination problems. In this work, we propose an approach to analyze the quality of composed services using fault injection techniques, by inspecting the reaction of a composed process to injected faults; the aim is to assess the process quality in terms of fault monitoring and, more generally, fault tolerance capabilities. The component services are analyzed either as black-boxes, when only input and output messages are considered or as white-boxes, when data sources used by services are considered. A test bed is illustrated on a selected example, and results of extensive testing are discussed and framed into a process analysis methodology.
Accurate Camera Calibration from Multi-View Stereo and Bundle Adjustment
Authors: Yasutaka Furukawa, Jean Ponce
Venue: International Journal of Computer Vision (2009)

The advent of high-resolution digital cameras and sophisticated multi-view stereo algorithms offers the promise of unprecedented geometric fidelity in image-based modeling tasks, but it also puts unprecedented demands on camera calibration to fulfill these promises. This paper presents a novel approach to camera calibration where top-down information from rough camera parameter estimates and the output of a multi-view-stereo system on scaled-down input images is used to effectively guide the search for additional image correspondences and significantly improve camera calibration parameters using a standard bundle adjustment algorithm (Lourakis and Argyros 2008). The proposed method has been tested on six real datasets including objects without salient features for which image correspondences cannot be found in a purely bottom-up fashion, and objects with high curvature and thin structures that are lost in visual hull construction even with small errors in camera parameters. Three different methods have been used to qualitatively assess the improvements of the camera parameters. The implementation of the proposed algorithm is publicly available at Furukawa and Ponce (2008b).
An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues
Authors: Fangju Wang, Kyle Swegles
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Spoken dialogue systems (SDSs) have been widely used in human-computer communications, including database querying, online trouble shooting advising, etc. A major challenge in building an SDS is to handle ambiguity in natural languages. User queries, questions, descriptions in a natural language may be ambiguous. To be effective in practical applications, an SDS must be able to disambiguate input from its user(s). In our research, we develop an online algorithm for applying reinforcement learning to handle ambiguity in SDSs. We introduce a new user dialogue policy into the framework of reinforcement learning to model user dialogue behavior. Also, differing from the current reinforcement learning algorithms in speech and language processing that are characterized by offline training, our algorithm conducts both offline and online detection of user dialogue behavior. In this paper, we present the online algorithm for reinforcement learning, emphasizing the detection of user dialogue behavior. We also describe the initial implementation and experiments.
Global Passivity of Stochastic Neural Networks with Time-Varying Delays
Authors: Jinming Liang, Qiankun Song
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this paper, the passivity problem is investigated for a class of stochastic neural networks with time-varying delays as well as generalized activation functions. By employing a combination of Lyapunov functional, the free-weighting matrix method and stochastic analysis technique, a delay-independent criterion for the passivity of the addressed neural networks is established in terms of linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. An example is given to show the effectiveness and less conservatism of the proposed criterion. It is noteworthy that the traditional assumptions on the differentiability of the time-varying delays and the boundedness of its derivative are removed.
No Syllogisms for the Numerical Syllogistic
Authors: Ian Pratt-Hartmann
Venue: Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday (2009)

The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional syllogistic, a finite collection of rules, similar in spirit to the classical syllogisms, constitutes a sound and complete proof-system. The question arises as to whether such a proof system exists for the numerical syllogistic. This paper answers that question in the negative: no finite collection of syllogism-like rules, broadly conceived, is sound and complete for the numerical syllogistic.
Reasoning about multi-attribute preferences
Authors: Koen Hindriks, Catholijn Jonker, Wietske Visser
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In our aim to develop a negotiation support system, we are faced with the need to express a user's preferences. The offers that are exchanged usually consist of multiple attributes. An agreement can only be reached if the preferences from both parties over these attributes and the complete offers are taken into account. The acceptablilty of an offer is defined in terms of the value that a negotiator attaches to it.
Compound TCP with Random Losses
Authors: Alberto Blanc, Konstantin Avrachenkov, Denis Collange, Giovanni Neglia
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

We analyze the performance of a single, long-lived, Compound TCP (CTCP) connection in the presence of random packet losses. CTCP is a new version of TCP implemented in Microsoft Windows to improve the performance on networks with large bandwidth delay-products. We derive a Markovian model for the CTCP sending window and compute the steady state distribution of the window and the average throughput of a CTCP connection. We observe that the previous approximation, using a "typical cycle," underestimates the average window and its variance while the Markovian model gives more accurate results. We use our model to compare CTCP and TCP Reno. We notice that CTCP gives always a throughput equal or greater than Reno, while relative performance in terms of jitter depends on the specific network scenario: CTCP generates more jitter for moderate-high drop rate values, while the opposite is true for low drop rate values.
Product-mix Design Decision under TOC by Soft-sensing of Level of Satisfaction using Modified Fuzzy-LP
Authors: Arijit Bhattacharya, Pandian Vasant
Venue: Proceeding of the 2006 conference on Integrated Intelligent Systems for Engineering Design (2006)

This chapter outlines an intelligent fuzzy linear programming (FLP) having a flexible logistic membership function (MF) in finding out fuzziness patterns at disparate level of satisfaction for theory of constraints-based (TOC) product-mix design problems. One objective of the present work is to find out degree of fuzziness of product-mix decisions having disparate level of satisfaction of decision-maker (DM). Another objective is to provide a robust, quantified monitor of the level of satisfaction of DMs and to calibrate these levels of satisfaction against DMs' expectations. Fuzzy-sensitivity of the decision has been focused for a bottle-neck-free, optimal product-mix solution of TOC problem.
Continuous and impulsive vaccination of SEIR epidemic models with saturation incidence rates
Authors: Juan Hou, Zhidong Teng
Venue: Mathematics and Computers in Simulation (2009)

In this paper, two delayed SEIR epidemic models with continuous and impulsive vaccination and saturating incidence are investigated. The dynamical behaviors of the disease are analyzed. For continuous vaccination, we obtain a basic reproductive number R"1 and prove that if R"1@?1 then the disease-free equilibrium is globally attractive and if R"1>1 then the disease is permanent by using the Lyapunov functional method. For impulsive vaccination, we obtain two thresholds R^* and R"* and prove that if R^*1 then the disease is permanent by using the comparison theorem of impulsive differential equation and the Lyapunov functional method. Lastly, we compared the effects of two vaccination strategies.
Snake-like motion controller design with TMS320C6713 DSP processor
Authors: R. P. Chatterjee, Uma Dutta
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

This paper focuses on the controller design procedure for any serial linked robot which articulates a typical snake like movement in surface level. Programmable smart DSP processor is used for high accuracy signal processing and smooth control of the actuator used in each joint of SLR. Different approaches like, frequency domain approach and graphical approach for controller design are discussed and the same are implemented in TMS320C6713 DSP processor to study the controller characteristics with their transient and impulse response. Results infer the difference between two transfer functions of DC motor controller designed in the above fashion with similar parameters.
Error Analysis and Verification of an IEEE 802.11 OFDM Modem using Theorem Proving
Authors: Abu Nasser Mohammed Abdullah, Behzad Akbarpour, Sofiène Tahar
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

IEEE 802.11 is a widely used technology which powers many of the digital wireless communication revolutions currently taking place. It uses OFDM (Orthogonal Frequency Division Multiplexing) in its physical layer which is an efficient way to deal with multipath, good for relatively slow time-varying channels, and robust against narrowband interference. In this paper, we formally specify and verify an implementation of the IEEE 802.11 standard physical layer based OFDM modem using the HOL (Higher Order Logic) theorem prover. The versatile expressive power of HOL helped us model the original design at all abstraction levels starting from a floating-point model to the fixed-point design and then synthesized and implemented in FPGA technology. We have been able to find a bug in one of the blocks of the design that is responsible for modulation which implementation diverts from the constellation provided in the IEEE standard specification. The paper also derives new expressions for the rounding error accumulated during ideal real to floating-point and fixed-point transitions at the algorithmic level and performs a formal error analysis for the OFDM modem in HOL.