ppxscal/embedding_network huggingface dataset:
Object Caching for Queries and Updates
Authors: Philip Little, Amitabh Chaudhary
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

We consider a new online problem, called caching for queries and updates, which encompasses three expansions to standard caching: requests can be for multiple data objects (or &ldquo;file bundles&rdquo;), requests can be queries that return results much smaller than the data they access, or there may be updates to the data at the source. Different combinations of these expansions arise in modern applications such as scientific computing on data-grids and middle-tier caching in web-based databases. We present a randomized online (2&alpha;&thinsp;+&thinsp;2)-competitive algorithm for this problem, given any &alpha;-competitive algorithm for the well studied object caching (multi-size paging) problem. This is the first known online algorithm for the combined problem and for several simpler combinations of the three extensions. This algorithm is both space-efficient and computationally tractable and has bounded overhead for control communication.
Laptops Just the Steps For Dummies
Authors: Ryan Williams
Venue: For Dummies (2008)

Youll get the straight, simple lessons that you need to effectively use your Vista powered laptop in Laptops Just the Steps For Dummies. Get where you need to go with a minimum of steps! This book lays out a specific goal and helps you achieve it with a series of lessons, paired with tips and graphics to illustrate the task. You can read this book from cover to cover or skip to the parts that you need to know.In a flash, you will understand the basic parts, switches, and drives that make up your laptop. Youll learn how to operate the main functions of Windows Vista, like managing user accounts, navigating the system, and working with files, folders, software, and devices. Youll learn how to create media and connect to the Internet with or without wires! Youll discover how to troubleshoot and patch your operating system. You will find out how to:Clean and maintain your laptop Operate Windows Vista and manage its options Create and store media Set up a router, connect to a network, and go wireless Sync data and create backups Browse safely Troubleshoot hardware and software and patch your operating system Laptops Just the Steps For Dummies provides you with all of the information you need to work more efficiently than ever before!
A Rough Set-Based SVM Classifier for ATR on the Basis of Invariant Moment
Authors: Lei Huang, Ying-jun Ma, Lei Guo
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Automatic target recognition (ATR) is an important task in image application. A classifier for the airplane recognition based on the merits of Rough set theory (RST)and Directed Acyclic Graph Support Vector Machines (DAGSVM) is proposed in this paper. RST can mine useful information from a large number of data and generate decision rules without prior knowledge. DAGSVM have better classification performances than other SVMs methods and good capabilities of fault-tolerance and generalization. RST is used as preprocessing step to improve the performances of DAGSVM. Coupled together with RST and DAGSVM techniques they enable the ATR system to identify airplane type on the basis of certain shape feature sets in the images. The methods proposed are compared with general SVMs approach and are shown to perform somewhat better on the remote sensing images.
On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
Authors: Qinian Jin, Ulrich Tautenhahn
Venue: Numerische Mathematik (2009)

We consider the computation of stable approximations to the exact solution $${x^\dagger}$$of nonlinear ill-posed inverse problems F(x) = y with nonlinear operators F : X &#x2192; Y between two Hilbert spaces X and Y by the Newton type methods $$x_{k+1}^{\delta}=x_{0}-g_{\alpha_{k}}\left(F'(x_{k}^{\delta})^*F'(x_{k}^{\delta})\right) F'(x_{k}^{\delta})^*\left(F(x_{k}^{\delta})-y^{\delta}-F'(x_{k}^{\delta})(x_{k}^{\delta}-x_{0})\right)$$of y satisfying $${\|y^\delta - y\| \le \delta}$$with a given small noise level $${\delta > 0}$$. We terminate the iteration by the discrepancy principle in which the stopping index $${k_\delta}$$ is determined as the first integer such that $$\|F(x_{k_\delta}^{\delta})-y^{\delta}\|\le \tau \delta < \|F(x_{k}^{\delta})-y^{\delta}\|, \quad 0\le k < k_{\delta}$$converges to $${x^\dagger}$$as $${\delta \rightarrow 0}$$and establish various order optimal convergence rate results. It is remarkable that we even can show the order optimality under merely the Lipschitz condition on the Fr&#x00e9;chet derivative F&#x2032; of F if $${x_{0} - x^\dagger}$$ is smooth enough.
A 3D prototyping chip based on a wafer-level stacking technology
Authors: Nobuaki Miyakawa
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

We have developed a new 3-dimensional stacking technology using wafer-to-wafer stacked method and evaluated the connectivity between TSV and micro-bump. The prototype 3-layer stacking device has been tried using our technology and the functional yield reached more than 60%. Using 8-inch wafer. We propose one of the design methodologies for a 3D stacked device.
How to approach humans?: strategies for social robots to initiate interaction
Authors: Satoru Satake, Takayuki Kanda, Dylan F. Glas, Michita Imai, Hiroshi Ishiguro, Norihiro Hagita
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This paper proposes a model of approach behavior with which a robot can initiate conversation with people who are walking. We developed the model by learning from the failures in a simplistic approach behavior used in a real shopping mall. Sometimes people were unaware of the robot's presence, even when it spoke to them. Sometimes, people were not sure whether the robot was really trying to start a conversation, and they did not start talking with it even though they displayed interest. To prevent such failures, our model includes the following functions: predicting the walking behavior of people, choosing a target person, planning its approaching path, and nonverbally indicating its intention to initiate a conversation. The approach model was implemented and used in a real shopping mall. The field trial demonstrated that our model significantly improves the robot's performance in initiating conversations.
Law enforcement: do the systems really provide the information and safeguards promised?
Authors: Glen E. Pommerening Howard Bjorklund Melvin F. Bockelman Alan A. Hamilton
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Law Enforcement---An updating of the advances made in providing information for the management of law enforcement and problems still facing these activities and the resources being brought to bear on their solutions.
Workload-aware data partitioning in community-driven data grids
Authors: Tobias Scholl, Bernhard Bauer, Jessica Müller, Benjamin Gufler, Angelika Reiser, Alfons Kemper
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Collaborative research in various scientific disciplines requires support for scalable data management enabling the efficient correlation of globally distributed data sources. Motivated by the expected data rates of upcoming projects and a growing number of users, communities explore new data management techniques for achieving high throughput. Community-driven data grids deliver such high-throughput data distribution for scientific federations by partitioning data according to application-specific data and query characteristics. Query hot spots are an important and challenging problem in this environment. Existing approaches to load-balancing from Peer-to-Peer (P2P) data management and sensor networks do not directly meet the requirements of a data-intensive e-science environment. In this paper, our contributions are partitioning schemes based on multi-dimensional index structures enabling communities to trade off data load balancing and handling query hot spots via splitting and replication. We evaluate the partitioning schemes with two typical kinds of data sets from the astrophysics domain and workloads extracted from Sloan Digital Sky Survey (SDSS) query traces and perform throughput measurements in real and simulated networks. The experiments demonstrate the improved workload distribution capabilities and give promising directions for the development of future community grids.
XTream: an open, distributed platform for processing personal information streams
Authors: Michael Duller, Gustavo Alonso
Venue: Proceedings of the Third Workshop on Dependable Distributed Data Management (2009)

Personal information processing is an important and difficult challenge due to the many constraints involved and the need for open, easy to use systems. In the XTream project, we envision an extensible runtime platform and programming model that support users in easily defining complex data stream processing chains that can be arbitrarily connected to the streams of other users. The platform is based on modularization and service orientation to provide extensibility and handle the dynamism immanent in personal information processing applications. In this short paper we outline the most important aspects of the project.
Photonic ultra-wideband monocycle pulse generation using a single electro-optic modulator
Authors: Songnian Fu, Jianqiang Li, P. Shum
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A compact and low-cost approach to photonic ultra-wideband (UWB) monocycle pulse generation is proposed and experimentally demonstrated based on the wavelength dependence of the half-wave voltage of a Mach-Zehnder modulator (MZM). By employing a single MZM and two laser sources at around 1310nm and 1550nm, a pair of polarity-reversed monocycle pulses with the full width at half maximum (FWHM) of about 80ps and the fractional bandwidth of greater than 160% can be generated. Our experiment results show a good agreement with the theoretical prediction. The simple setup and the convenience to control the monocycle pulse polarity are highly favorable to the future UWB applications.
Identification using ANFIS with intelligent hybrid stable learning algorithm approaches
Authors: Mahdi Aliyari Shoorehdeli, Mohammad Teshnehlab, Ali Khaki Sedigh
Venue: Neural Computing and Applications (2009)

This paper suggests novel hybrid learning algorithm with stable learning laws for adaptive network based fuzzy inference system (ANFIS) as a system identifier and studies the stability of this algorithm. The new hybrid learning algorithm is based on particle swarm optimization (PSO) for training the antecedent part and gradient descent (GD) for training the conclusion part. Lyapunov stability theory is used to study the stability of the proposed algorithm. This paper, studies the stability of PSO as an optimizer in training the identifier, for the first time. Stable learning algorithms for the antecedent and consequent parts of fuzzy rules are proposed. Some constraints are obtained and simulation results are given to validate the results. It is shown that instability will not occur for the leaning rate and PSO factors in the presence of constraints. The learning rate can be calculated on-line and will provide an adaptive learning rate for the ANFIS structure. This new learning scheme employs adaptive learning rate that is determined by input&#x2013;output data.
A Zero Forcing and Sphere Decoding Joint Detector for Multiple Input Multiple Output LAS-CDMA System
Authors: Hancheng Liao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In order to further decrease the detection complexity, a joint detection method based on both zero forcing and sphere decoding is proposed. When the signal-to-noise ratio is high enough, such detector results in zero forcing detection, otherwise it subtracts the decoded signals from the receiving signal and then decodes them by sphere decoding algorithm. In the multiple input multiple output LAS-CDMA system, both the performance of 2&times;2 and 4&times;4 transmitter &times; receiver cases is simulated by computer. Simulation results show that the performance of such joint algorithm is nearly the same as that of sphere decoding algorithm. Such joint algorithm can reduce the detection complexity as well as hold the decoding performance good enough. 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
Comparison of two colour calibration techniques for digital photography
Authors: Tzvetomir Vassilev, Bernhard Spanlang
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

This paper compares two colour calibration techniques for digital photography. The first one is based on the white balancing, incorporated in the digital cameras plus brightness adjustment. The second one uses a colour checker card and a utility from the RADIANCE simulation system. Results and conclusions are given at the end of the paper.
Using ORM-Based Models as a Foundation for a Data Quality Firewall in an Advanced Generation Data Warehouse (Extended Version)
Authors: Baba Piprani
Venue: Journal on Data Semantics XI (2008)

Data Warehouses typically represent data being integrated from multiple source systems. There are inherent data quality problems when data is being consolidated in terms of data semantics, master data integration, cross functional business rule conflicts, data cleansing, etc. This use case demonstrates how multiple Object Role Models were successfully used in the establishment of a Data Quality Firewall architecture to define an Advanced Generation Data Warehouse. The ORM models represented the realization of the 100% principle in ISO TR9007 Report on Conceptual Schemas, that were then successfully transformed into attribute-based models to generate SQL DBMS schemas. These were then subsequently used in RDBMS code generation for an 100% automated implementation for the Data Quality Firewall checks based on the described advanced generation Data Warehouse architecture. This same Data Quality Firewall approach has also been successfully used in implementing multiple web based applications, characteristically yielding a representative savings of 35-40% savings in development costs. The intent of the paper is to explain how ORM can be successfully used in the eventual implementation of a data quality firewall, including the details of the architecture of the data quality firewall in an enterprise data warehouse to enable data quality assurance. It is not within the scope of this paper to address the use or merits of alternative modelling paradigms in this regard.
The Turtle and the Shark
Authors: Ryan Woodward
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

The Turtle and the Shark, one of the most popular Samoan legends, tells the story of a man and a woman who are to be separated by the king, Malietoafaiga. To avoid separation, they fled to another island. However, fearing their act of disobedience would bring dishonor on their families, they willingly gave up their lives at the cliffs of Vaitogi. The gods had mercy on them and transformed them into a turtle and a shark to live together, forever.
Doing More with SAS/ASSIST 9.1
Authors: SAS Publishing
Venue:  (2008)

Take advantage of the power of SAS using SAS/ASSIST software. Users of all levels will find this title informative. It provides instructions for a wide variety of tasks, including more advanced tasks than you will find in Getting Started with SAS/ASSIST 9.1. Some of the many tasks described in this title include combining data, creating formats and informats, generating sophisticated graphics, and performing advanced query and reporting tasks. This title is designed primarily for developers of SAS applications. However, end users of those applications and administrators of resources that are used by those applications will also find this title useful
Robust stabilization of continuous indeterminate systems
Authors: A. Kh. Gelig, I. E. Zuber
Venue: Automation and Remote Control (2009)

The system of an arbitrary order with one scalar control is considered. It is assumed that coefficients of the system and vectors of distribution of control are bounded and are functionals of an arbitrary character. With the aid of the Lyapunov function in a quadratic form with the constant Jacobian matrix of coefficients of a special form, the conditions for bounds of a change of the coefficients are obtained, in the fulfillment of which the linear stationary control by the state is synthesized. In this control, the system becomes exponentially stable on the whole.
Exact bootstrap k-nearest neighbor learners
Authors: Brian M. Steele
Venue: Machine Learning (2009)

Bootstrap aggregation, or bagging, is a method of reducing the prediction error of a statistical learner. The goal of bagging is to construct a new learner which is the expectation of the original learner with respect to the empirical distribution function. In nearly all cases, the expectation cannot be computed analytically, and bootstrap sampling is used to produce an approximation. The k-nearest neighbor learners are exceptions to this generalization, and exact bagging of many k-nearest neighbor learners is straightforward. This article presents computationally simple and fast formulae for exact bagging of k-nearest neighbor learners and extends exact bagging methods from the conventional bootstrap sampling (sampling n observations with replacement from a set of n observations) to bootstrap sub-sampling schemes (with and without replacement). In addition, a partially exact k-nearest neighbor regression learner is developed. The article also compares the prediction error associated with elementary and exact bagging k-nearest neighbor learners, and several other ensemble methods using a suite of publicly available data sets.
Visual Analysis of One-to-Many Matched Graphs
Authors: Emilio Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

Motivated by applications of social network analysis and of Web- search clustering engines, we describe an algorithm and a system for the display and the visual analysis of two graphs G 1 and G 2 such that each G i is defined on a different data set with its own primary relationships and there are secondary relationships between the vertices of G 1 and those of G 2. Our main goal is to compute a drawing of G 1 and G 2 that makes clearly visible the relations between the two graphs by avoiding their crossings, and that also takes into account some other important aesthetic requirements like number of bends, area, and aspect ratio. Application examples and experiments on the system performances are also presented.
An empirical approach to evaluating dependency locality in hierarchically structured software systems
Authors: Liguo Yu, Srini Ramaswamy
Venue: Journal of Systems and Software (2009)

In software development, especially component-based software development, dependency locality states that relevant software components should be at shorter distances than irrelevant components. This principle is used together with modularity and hierarchy to guide the design of large-scale complex software systems. In previous work, dependency locality and its correlation with design quality were studied by statically measuring the interactions between software components. This paper presents an empirical approach to evaluating the hierarchical structure of software systems through mining their revision history. Two metrics, spatial distance and temporal distance, are adapted to measure the dependencies between software components. The correlation of spatial distance and temporal distance between software components represents a factor that influences system design quality. More specially, a well designed system hierarchy should have a significant positive correlation while a non-significant positive correlation or a negative correlation would signify design flaws. In an application of this approach, we use Mantel test to study the dependency locality of six software systems from Apache projects.
Rosetta: Standardization at the System Level
Authors: Perry Alexander
Venue: Computer (2009)

By evaluating language constructs and their usage, Rosetta can provide insight into system-level design.
Velocity control of bimodal-tram using sliding mode controlwith anti-windup scheme
Authors: Yeun-Sub Byun, Min-Soo Kim, Jai-Kyun Mok, Young-Chol Kim
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

In this paper, we propose the velocity controller of bimodal tram. The Korea Rail road Research Institute (KRRI) is developing the bimodal tram. The bimodal tram is all wheel steered single articulated vehicle and will be equipped with the automated control systems. The key technology of the systems is longitudinal and lateral vehicle control algorithm. The longitudinal control is concerned with traction control and brake control of the vehicle and the lateral control is concerned with steering control. First, a longitudinal vehicle model is introduced for traction and brake. Then, a velocity tracking controller is designed based on sliding mode control with anti-windup scheme. The simulation results are shown to illustrate the performance of the proposed velocity control algorithm.
Implicitization of rational ruled surfaces with µ-bases
Authors: Marc Dohm
Venue: Journal of Symbolic Computation (2009)

Chen, Sederberg, and Zheng introduced the notion of a ¼-basis for a rational ruled surface in Chen et al. [Chen, F., Zheng, J., Sederberg, T. W., 2001. The &mu;-basis of a rational ruled surface. Comput. Aided Geom. Design 18 (1), 6172] and showed that its resultant is the implicit equation of the surface, if the parametrization is generically injective. We generalize this result to the case of an arbitrary parametrization of a rational ruled surface. We also give a new proof for the corresponding theorem in the curve case and treat the reparametrization problem for curves and ruled surfaces. In particular, we propose a partial solution to the problem of computing a proper reparametrization for a rational ruled surface.
Interfacing communication network to IBM system/360 and system/370 host processors: an end users viewpoint
Authors: John T. M. Pryke, Lawrence J. Munini
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Before discussing interfaces per se, it seems wise to review briefly the existing IBM communications environment. As shown in Figure 1, there are four basic types of hardware components. These are remote terminal devices, which may consist of high-speed RJE stations; low-speed time sharing terminals, (CRT or hardcopy); remote CPU's; and a variety of other specialized remote devices (credit card readers, etc.).