ppxscal/embedding_network huggingface dataset:
Microsoft Windows SharePoint Services 3.0 Quick Source Guide
Authors: Quick Source
Venue:  (2007)

Do you need an easy-to-follow software reference right at your fingertips? Our 6 page, tri-fold guides are the answer. These quick reference guides include step by step instructions to help users to learn software features more quickly, as well as full color screen graphics to highlight important features. Quick Source reference guides also include the software program s NEW features and gives you quick access to time saving shortcuts. The Microsoft Windows SharePoint Services 3.0 for Windows Server 2003 is a clear and concise tool for learning the features in SharePoint Services 2003. Features contained in this guide include NEW features such as Using a Wiki Site, Editing a Wiki Page, Creating a New Wiki Page, and Creating a New Wiki Page from a Link. It also includes Deleting an Item, Creating an Announcement, Editing a List Item, Opening and Editing a Document, Working with Versions, Using a Meeting Workspace, Uploading a Picture to a Library, Creating a Basic Web Page, Creating an Alert for a List or Library, and much more.
Zerber+R: top-k retrieval from a confidential index
Authors: Sergej Zerr, Daniel Olmedilla, Wolfgang Nejdl, Wolf Siberski
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Privacy-preserving document exchange among collaboration groups in an enterprise as well as across enterprises requires techniques for sharing and search of access-controlled information through largely untrusted servers. In these settings search systems need to provide confidentiality guarantees for shared information while offering IR properties comparable to the ordinary search engines. Top-k is a standard IR technique which enables fast query execution on very large indexes and makes systems highly scalable. However, indexing access-controlled information for top-k retrieval is a challenging task due to the sensitivity of the term statistics used for ranking. In this paper we present Zerber+R -- a ranking model which allows for privacy-preserving top-k retrieval from an outsourced inverted index. We propose a relevance score transformation function which makes relevance scores of different terms indistinguishable, such that even if stored on an untrusted server they do not reveal information about the indexed data. Experiments on two real-world data sets show that Zerber+R makes economical usage of bandwidth and offers retrieval properties comparable with an ordinary inverted index.
Multi-resolution spatial simulation for molecular crowding
Authors: Matthias Jeschke, Adelinde M. Uhrmacher
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Spatial phenomena attract increasingly interest in computational biology. Molecular crowding, i.e. a dense population of macromolecules, is known to have a significant impact on the kinetics of molecules. However, an in-detail inspection of cell behavior in time and space is extremely costly. To balance between cost and accuracy, multi-resolution approaches offer one solution. Particularly, a combination of individual and lattice-population based algorithms promise an adequate treatment of phenomena like macromolecular crowding. In realizing such an approach, central questions are how to specify and synchronize the interaction between population and individual spatial level, and to decide what is best treated at a specific level, respectively. Based on an algorithm which combines the Next Subvolume Method and a simple, individual-based spatial approach, we will present possible answers to these questions, and will discuss first experimental results.
Bayesian analysis of two dependent 2×2 contingency tables
Authors: Anastasia G. Eleftheraki, Maria Kateri, Ioannis Ntzoufras
Venue: Computational Statistics Data Analysis (2009)

Bayesian analysis of correlated binary data when individual information is not available is considered. In particular, a binary outcome is measured on the same subjects of two independent groups at two separate occasions (usually time points). The groups are formulated through a binary exposure or a prognostic factor. Interest lies in estimating the association between exposure and outcome over time. Standard methods for this purpose apply on the individual item responses and are insufficient in case these are missing. Moreover it is assumed that the only available information is the marginal 2x2 cross-tabulations between the grouping variable and the response for each occasion. Assuming independent binomial distributions for the two groups, the success probabilities for each occasion as well as the associations between exposure and outcome, based on the corresponding odds ratios, are estimated. In order to deal with the missing information of each item's response and to estimate the corresponding transition probabilities, a Bayesian procedure is adopted.
Pressure-Rate Deconvolution Using Nonorthogonal Exponential Functions Dictionary
Authors: Mircea Andrecut, Azad M. Madni
Venue: Journal of Integrated Design Process Science (2007)

The deconvolution method, which has received considerable attention recently, is rapidly becoming one of the major tools for well test and production data analysis in the oil and gas industry. The clear justification for this approach is the fact that in well-test and production data analysis we are interested in the transient response which, for a stable linear system, is a linear combination of exponential functions. In this paper, we present a new deconvolution approach, which is potentially an important contribution to the existing body of knowledge in this field. We show that the solution of the deconvolution problem can be successfully represented as a linear combination of non-orthogonal exponential functions. In addition, we present three deconvolution algorithms. The first two algorithms are based on regularization concepts borrowed from the wellknown Tikhonov and Krylov methods. The third algorithm is based on the stochastic Monte Carlo method. Our analysis results show that the Tikhonov regularization method is stable, and feasible for a modest number of data points. Based on the results, the Krylov conjugate gradient method requires minimal storage and achieves fast convergence. This method is recommended for small to large data sets. The Monte Carlo method achieved the best results. It was able to handle large amounts of data, had minimal storage requirements, was robust to noise and avoided local minima. However, the Monte Carlo method was noticeably slower than the others. The computational results show that the exponential basis functions decomposition method provides a robust, solution in the presence of moderate levels of noise.
Support of decision on engineering objects by affect zone definition and information content modeling
Authors: László Horváth, Imre J. Rudas
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Development of products in the competitive industries uses modeling, simulation, product data management, and Internet portal based systems for lifecycle management of product information. Engineering has been elevated to a high level. However, new problems have been emerged in practical application of this virtual technology. The product model basically consists of definitions for engineering objects and their relationships. As a new problem, high number of unorganized relationships makes handling of changes in large product models difficult or even impossible. The authors analyzed this problem and proposed a method as a contribution to one of the possible solutions for that problem. Most important elements of their findings are published in this paper. In Chapter 2, they discuss product development in virtual space, emphasize critical issues, and cite relevant research results. In Chapter 3, they explain their new method for organized management of dependencies in large product models. Chapter 4 introduces a new method for the extension of classical product model to content of model information. Finally, Chapter 5 is a short introduction to the implementation of the proposed modeling in professional systems for lifecycle management of product information.
Intra- and Inter-Stream Synchronisation for Stored Multimedia Streams
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Multimedia streams such as audio and video impose tight temporal constraints due to their continuous nature. Often, different multimedia streams must be presented in a synchronized way. We introduce a scheme for the continuous and synchronous delivery of distributed stored multi media streams across a communications network. We propose a protocol for the synchronized playback, compute the buffer requirement, and describe the experimental results of our implementation. The scheme is very general and does not require bounded jitter or synchronized clocks and is able to cope with clock drifts and server drop outs. 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
Verification and validation of simulation models
Authors: Robert G. Sargent
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper we discuss verification and validation of simulation models. Four different approaches to deciding model validity are described; two different paradigms that relate verification and validation to the model development process are presented; various validation techniques are defined; conceptual model validity, model verification, operational validity, and data validity are discussed; a way to document results is given; a recommended procedure for model validation is presented; and model accreditation is briefly discussed.
Virtual Money Systems: A Phenomenal Analysis
Authors: Jingzhi Guo, Angelina Chow
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

In the development of virtual communities, a new phenomenon of virtual money is observed and presented high importance to both e-commerce and e-society fields. This paper, as a pioneer research, has attempted to make a phenomenal analysis on the existing virtual money systems. By the analysis, this paper has defined what virtual money is, what its general models are, and how its existing systems work. By the analysis, the features of existing virtual money systems are abstracted and their problems are summarized. Driven by the motivation of utilizing and improving the existing virtual money systems, this paper has outlined a novel generic virtual money system model called Common Money (CONEY) to resolve the problems that bother the existing virtual money systems. Finally, further interesting issues for future research are given.
Establishing an Integrated Process Management System (IPMS) in ship management companies
Authors: Metin Celik
Venue: Expert Systems with Applications: An International Journal (2009)

This paper motivates on redesigning the traditional management style of global shipping firms in order to originally establish an Integrated Process Management System (IPMS) on the basis of quality aspects, environmental concerns, and occupational health and safety requirements. The requirements of ISO 9001:2000, ISO 14001:2004, and OHSAS 18001:2007 are comparatively assessed with respect to International Safety Management (ISM) Code clauses via using Fuzzy Axiomatic Design (FAD) while Analytic Network Process (ANP) enables to identify critical managerial processes of shipping business. Consequently, the fundamental structure of IPMS is proposed based on the quantitative outcomes of FAD and ANP approaches. In practice, the IPMS can be adopted into shore-based organizations in accordance with the prior principles of ship management companies.
Performance analysis of Ethernet Powerlink networks for distributed control and automation systems
Authors: G. Cena, L. Seno, A. Valenzano, S. Vitturi
Venue: Computer Standards Interfaces (2009)

Industrial communication networks are a key element for developing advanced distributed control and automation systems. On the one hand, high performance and low costs are generally required to cope with more and more demanding application requirements, while, on the other hand, real-time capabilities are often needed in an increasing number of automation scenarios. Communication solutions based on Ethernet technologies are becoming popular in many industrial and factory environments and a number of soft/hard real-time competing products have been proposed in the last few years. This paper focuses on the Ethernet Powerlink standard, in general, and on some of its real-time characteristics, in particular. In fact, we present some basic results concerning both cyclic and acyclic real-time traffic in Ethernet Powerlink networks, obtained by extensive simulation, which can be used as a basic step for a better understanding of the real-time behavior of this protocol.
Affine and Toric Hyperplane Arrangements
Authors: Richard Ehrenborg, Margaret Readdy, Michael Slone
Venue: Discrete Computational Geometry (2009)

We extend the Billera&#x2013;Ehrenborg&#x2013;Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky&#x2019;s fundamental results on the number of regions.
Parameter identifiability for heat conduction with a boundary input
Authors: Semion Gutman, Junhong Ha
Venue: Mathematics and Computers in Simulation (2009)

The identifiability (i.e. the unique identification) of conductivity in a heat conduction process is considered in the class of piecewise constant conductivities. The 1-D process may have nonzero boundary inputs as well as distributed inputs. Its measurements are collected at finitely many observation points. They are processed to obtain the first eigenvalue and a constant multiple of the first eigenfunction at the observation points. It is shown that the identification by the Marching Algorithm is continuous with respect to the mean convergence in the admissible set. The result is based on the continuous dependence of eigenvalues, eigenfunctions, and the solutions on the conductivities. Numerical experiments confirm the perfect identification for noiseless data. A numerical algorithm for the identification in the presence of noise is proposed and implemented.
Online Bicriteria Load Balancing Using Object Reallocation
Authors: Savio S. H. Tse
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

We study the bicriteria load balancing problem on two independent parameters under the allowance of object reallocation. The scenario is a system of $M$ distributed file servers located in a cluster, and we propose three online approximate algorithms for balancing their loads and required storage spaces during document placement. The first algorithm is for heterogeneous servers. Each server has its individual tradeoff of load and storage space under the same rule of selection. The other two algorithms are for homogeneous servers. The second algorithm combines the idea of the first one and the best existing solution for homogeneous servers. Using document reallocation, we obtain a smooth tradeoff curve of the upper bounds of load and storage space. The last one bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively; and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities of these three algorithms are $O(\log M)$ plus the cost of document reallocation.
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
Authors: Eric Goles, Cedric Little, Ivan Rapaport
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In the present work we find a non-trivial communication protocol describing the dynamics of an elementary CA, and we prove that there are no simpler descriptions (protocols) for such CA. This is, to our knowledge, the first time such a result is obtained in the study of CAs. More precisely, we divide the cells of Rule 218 into two groups and we describe (and therefore understand) its global dynamics by finding a protocol taking place between these two parts. We assume that x &epsilon; {0,1}n is given to Alice while y &epsilon; {0,1}n is given to Bob. Let us call z(x,y) &epsilon; {0,1} the result of the dynamical interaction between the cells. We exhibit a protocol where Alice, instead of the n bits of x, sends 2[log(n)] + 1 bits to Bob allowing him to compute z(x,y). Roughly, she sends 2 particular positions of her string x. By proving that any one-round protocol computing z(x,y) must exchange at least 2[log(n)]- 5 bits, the optimality of our construction (up to a constant) is concluded.
Advanced Techniques for Scientific Data Warehouses
Authors: S. Sai Satyanarayana Reddy, L. S. S. Reddy, V. Khanaa, A. Lavanya
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Data warehouses using a multidimensional view of data have become very popular in both business and science in recent years. Data warehouses for scientific purposes such as medicine and bio-chemistry1 pose several great challenges to existing data warehouse technology. Data warehouses usually use pre-aggregated data to ensure fast query response. However, pre-aggregation cannot be used in practice if the dimension structures or the relationships between facts and dimensions are irregular. A technique for overcoming this limitation and some experimental results are presented. Queries over scientific data warehouses often need to reference data that is external to the data warehouse, e.g., data that is too complex to be handled by current data warehouse technology, data that is ”owned” by other organizations, or data that is updated frequently. This paper presents a federation architecture that allows the integration of multidimensional warehouse data with complex external data.
Brief paper: Spacecraft relative rotation tracking without angular velocity measurements
Authors: Raymond Kristiansen, Antonio Loría, Antoine Chaillet, Per Johan Nicklasson
Venue: Automatica (Journal of IFAC) (2009)

We present a solution to the problem of tracking relative rotation in a leader-follower spacecraft formation using feedback from relative attitude only. The controller incorporates an approximate-differentiation filter to account for the unmeasured angular velocity. We show uniform practical asymptotic stability (UPAS) of the closed-loop system. For simplicity, we assume that the leader is controlled and that we know orbital perturbations; however, this assumption can be easily relaxed to boundedness without degrading the stability property. We also assume that angular velocities of spacecraft relative to an inertial frame are bounded. Simulation results of a leader-follower spacecraft formation using the proposed controller structure are also presented.
The Slice Algorithm for irreducible decomposition of monomial ideals
Authors: Bjarke Hammersholt Roune
Venue: Journal of Symbolic Computation (2009)

Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial ideals. The paper includes experiments showing good performance in practice.
Logic and Layout Aware Level Converter Optimization for Multiple Supply Voltage
Authors: Liangpeng Guo, Yici Cai, Qiang Zhou, Xianlong Hong
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Multiple supply voltage (MSV) is an effective scheme to achieve low power. Recent works in MSV are based on physical level and aim at reducing physical overheads, but all of them do not consider level converter, which is one of the most important issues in dual-vdd design. In this work, a logic and layout aware methodology and related algorithms combining voltage assignment and placement are proposed to minimize the number of level converters and to implement voltage islands with minimal physical overheads. Experimental results show that our approach uses much fewer level converters (reduced by 83.23% on average) and improves the power savings by 16% on average compared to the previous approach [1]. Furthermore, the methodology is able to produce feasible placement with a small impact to traditional placement goals.
Probabilistic classifiers and automated cancer registration: An exploratory application
Authors: Sandro Tognazzo, Bovo Emanuela, Fiore Anna Rita, Guzzinati Stefano, Monetti Daniele, Stocco Cramen Fiorella, Zambon Paola
Venue: Journal of Biomedical Informatics (2009)

A test of the performance of two probabilistic classifiers (random forests and multinomial logit models) in automatically defining cancer cases has been carried out on 5608 subjects, registered by the Venetian Tumour Registry (RTV) during the years 1987-1996 and manually checked for possible second cancers that occurred during the 1997-1999 period. An eightfold cross-validation was performed to estimate the classification error; 63 predictive variables were entered into the model fitting. The random forest allows to automatically classify 45% of subjects with a classification error lower than 5%, while the corresponding error is 31% for the multilogit model. The performance of the former classifier is appealing, indicating a potential drop of manually checked cases from 1750 to 960 per incidence year with a moderate error rate. This result suggests to refine the approach and extend it to other categories of manually treated cases.
A production inventory model with fuzzy random demand and with flexibility and reliability considerations
Authors: Soumen Bag, Debjani Chakraborty, A. R. Roy
Venue: Computers and Industrial Engineering (2009)

The classical inventory control models assume that items are produced by perfectly reliable production process with a fixed set-up cost. While the reliability of the production process cannot be increased without a price, its set-up cost can be reduced with investment in flexibility improvement. In this paper, a production inventory model with flexibility and reliability (of production process) consideration is developed in an imprecise and uncertain mixed environment. The aim of this paper is to introduce demand as a fuzzy random variable in an imperfect production process. Here, the set-up cost and the reliability of the production process along with the production period are the decision variables. Due to fuzzy-randomness of the demand, expected average profit of the model is a fuzzy quantity and its graded mean integration value (GMIV) is optimized using unconstraint signomial geometric programming to determine optimal decision for the decision maker (DM). A numerical example has been considered to illustrate the model.