ppxscal/embedding_network huggingface dataset:
The polynomial complexity of fully materialized coalesced cubes
Authors: Yannis Sismanis, Nick Roussopoulos
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The data cube operator encapsulates all possible groupings of a data set and has proved to be an invaluable tool in analyzing vast amounts of data. However its apparent exponential complexity has significantly limited its applicability to low dimensional datasets. Recently the idea of the coalesced cube was introduced, and showed that high-dimensional coalesced cubes are orders of magnitudes smaller in size than the original data cubes even when they calculate and store every possible aggregation with 100% precision. In this paper we present an analytical framework for estimating the size of coalesced cubes. By using this framework on uniform coalesced cubes we show that their size and the required computation time scales polynomially with the dimensionality of the data set and, therefore, a full data cube at 100% precision is not inherently cursed by high dimensionality. Additionally, we show that such coalesced cubes scale polynomially (and close to linearly) with the number of tuples on the dataset. We were also able to develop an efficient algorithm for estimating the size of coalesced cubes before actually computing them, based only on metadata about the cubes. Finally, we complement our analytical approach with an extensive experimental evaluation using real and synthetic data sets, and demonstrate that not only uniform but also zipfian and real coalesced cubes scale polynomially.
Structure and Majority Classes in Decision Tree Learning
Authors: Ray J. Hickey
Venue: The Journal of Machine Learning Research (2007)

To provide good classification accuracy on unseen examples, a decision tree, learned by an algorithm such as ID3, must have sufficient structure and also identify the correct majority class in each of its leaves. If there are inadequacies in respect of either of these, the tree will have a percentage classification rate below that of the maximum possible for the domain, namely (100 - Bayes error rate). An error decomposition is introduced which enables the relative contributions of deficiencies in structure and in incorrect determination of majority class to be isolated and quantified. A sub-decomposition of majority class error permits separation of the sampling error at the leaves from the possible bias introduced by the attribute selection method of the induction algorithm. It is shown that sampling error can extend to 25% when there are more than two classes. Decompositions are obtained from experiments on several data sets. For ID3, the effect of selection bias is shown to vary from being statistically non-significant to being quite substantial, with the latter appearing to be associated with a simple underlying model.
A low-power and high-gain fully integrated CMOS LNA
Authors: S. Toofan, A. R. Rahmati, A. Abrishamifar, G. Roientan Lahiji
Venue: Microelectronics Journal (2007)

In this paper, we present the design of a fully integrated CMOS low noise amplifier (LNA) with on-chip spiral inductors in 0.18@mm CMOS technology for 2.4GHz frequency range. Using cascode configuration, lower power consumption with higher voltage and power gain are achieved. In this configuration, we managed to have a good trade off among low noise, high gain, and stability. Using common-gate (CG) configuration, we reduced the parasitic effects of C"g"d and therefore alleviated the stability and linearity of the amplifier. This configuration provides more reverse isolation that is also important in LNA design. The LNA presented here offers a good noise performance. Complete simulation analysis of the circuit results in center frequency of 2.4GHz, with 37.6dB voltage gain, 2.3dB noise figure (NF), 50@W input impedance, 450MHz 3dB power bandwidth, 11.2dB power gain (S"2"1), high reverse isolation (S"1"2)
Two Dimensional Pattern Formation of Prey-predator System
Authors: Hongxia Shen, Zhen Jin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

We investigate the reaction-diffusion system of the classical Bazykin model in spatial two dimensional domain. In this paper, we derive the conditions for turing instability in detail and obtain the turing space, in which the spatial system can emerge turing pattern. Furthermore, we simulate the pattern formation using the periodical boundary condition. Our results show that the Bazykin system stabilizes to a striplike pattern structure when diffusion is present.
Returning modified rows - select statements with side effects
Authors: Andreas Behm, Serge Rielau, Richard Swagerman
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

SQL in the IBM® DB2® Universal DatabaseTM for Linux®, UNIX®, and Windows® (DB2 UDB) database management product has been extended to support nested INSERT, UPDATE, and DELETE operations in SELECT statements. This allows database applications additional processing on modified rows. Within a single unit of work, applications can retrieve a result set containing the modified rows from a table or view modified by an SQL data-change operation. This eliminates the need to select the row after an INSERT or UPDATE, or before a DELETE statement. As a result, fewer network round trips, less server CPU time, fewer cursors, and less server memory are required. In addition, deadlocks can be avoided. The proposed approach is integrated with the set semantics of SQL, and does not require any procedural logic or modifications on the underlying relational data model. Pipelining multiple update, insert and delete operations using the same source data provides a very efficient way for multitable data-change statements typically found in ETL (extraction, transformation, load) applications. We demonstrate significant performance benefit with our experiences in the TPC-C benchmark. Experimental results show that the new SQL is more efficient in query execution compared to classic SQL.
Optimization of Variability in Software Product Lines
Authors: Felix Loesch, Erhard Ploedereder
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

The widespread use of the product line approach allows companies to realize significant improvements in time-tomarket, cost, productivity, and quality. However, a fundamental problem in software product line engineering is that a product line of industrial size can easily incorporate several thousand variable features. The complexity caused by this amount of variability makes variability management and product derivation tasks extremely difficult. To address this problem, we present a new method to optimize the variability provided in a software product line. Our method constructs a visualization that provides a classification of the usage of variable features in real products derived from the product line. We show how this classification can be used to derive restructuring strategies for simplifying the variability. The effectiveness of our work is demonstrated by presenting a case study of optimizing the variability in a large industrial software product line.
Design for Testability A Survey
Authors: T. W. Williams
Venue: IEEE Transactions on Computers (1982)

This paper discusses the basics of design for testability. A short review of testing is given along with some reasons why one should test. The different techniques of design for testability are discussed in detail. These include techniques which can be applied to today's technologies and techniques which have been recently introduced and will soon appear in new designs.
Measuring the evolution of open source software systems with their communities
Authors: Yi Wang, Defeng Guo, Huihui Shi
Venue: ACM SIGSOFT Software Engineering Notes (2007)

Open Source Software (OSS) has become the subject of much commercial and academic interest in last few years. As traditional software, OSS also evolves to fulfill the need of stakeholders. Therefore, providing quantitative metrics for OSS evolution has also become an urgent issue. However, most existing studies of software evolution have been performed on systems developed within a single company using traditional management techniques. These metrics models are inadequate to measure OSS evolution. In this paper, we describe a preliminary evolution metrics set for evaluating OSS. The most significant novelty of this model is that it takes specific properties of Open Source Community (OSC) into consideration. In another word, we measure the evolution of OSS and OSC together. We also provide a lightweight case study on Ubuntu project using this metrics set. We find out that the Open Source Community and its members also play essential role in OSS evolution. We expect this metrics model can bring better understandings and explanations of phenomena in open source development and evolution.
Variational inclusions problems with applications to Ekeland's variational principle, fixed point and optimization problems
Authors: Lai-Jiu Lin
Venue: Journal of Global Optimization (2007)

In this paper, we prove the existence theorems of two types of systems of variational inclusions problem. From these existence results, we establish Ekeland's variational principle on topological vector space, existence theorems of common fixed point, existence theorems for the semi-infinite problems, mathematical programs with fixed points and equilibrium constraints, and vector mathematical programs with variational inclusions constraints.
Some Characteristics of Universal Cell Nets
Authors: J. T. Butler
Venue: IEEE Transactions on Computers (1973)

In this paper, one-output n-input combinatorial nondegenerate networks of cells are analyzed. The networks consist of one-output two-input cells that are universal in that they realize all 16 functions of the two-input variables. Such networks have a number of interesting properties, among which is the fact that if network N realizes F(x), it also realizes the dual function Fd(x).
Using genetic feature selection for improving cyber attack detection rate
Authors: Chi Hoon Lee, Doo Hyung Lee, Jin Wook Chung
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

As Internet becomes an essential tool for all kinds of business transactions, the issue for detecting network intrusion has received greater attention. In this paper, we suggest a novel method based on a genetic optimization that can improve the detection rate for attack patterns without a loss due to false-positive error rate. We focus on selecting a robust feature subset by designing a multicriteria optimization procedure. During the evaluation phase, the performance of proposed approach is contrasted against one of the state-of-the-art feature selection methods using a k nearest neighbor classifier. Experimental results show that the proposed approach is remarkably effective than using the full feature set.
Automating post-silicon debugging and repair
Authors: Kai-hui Chang, Igor L. Markov, Valeria Bertacco
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Modern IC designs have reached unparalleled levels of complexity, resulting in more and more bugs discovered after design tape-out However, so far only very few EDA tools for post-silicon debugging have been reported in the literature. In this work we develop a methodology and new algorithms to automate this debugging process. Key innovations in our technique include support for the physical constraints specific to post-silicon debugging and the ability to repair functional errors through subtle modifications of an existing layout. In addition, our proposed post-silicon debugging methodology (FogClear) can repair some electrical errors while preserving functional correctness. Thus, by automating this traditionally manual debugging process, our contributions promise to reduce engineers' debugging effort. As our empirical results show, we can automatically repair more than 70% of our benchmark designs.
ARM996HS: The First Licensable, Clockless 32-Bit Processor Core
Authors: Arjan Bink, Richard York
Venue: IEEE Micro (2007)

Clockless implementations dramatically improve energy efficiency without requiring more area than conventional synchronous circuit designs. The clockless ARM996HS, developed through the TiDE design flow, consumes about one-third the power of comparable synchronous, clock-gated, ARM cores implementing the same ISA. The ARM996HS also generates low peak currents and produces very low electromagnetic emissions, and it is robust against variations in current, voltage, and temperature.
Semantic annotation and retrieval of video events using multimedia ontologies
Authors: Andrew D. Bagdanov, Marco Bertini, Alberto Del Bimbo, Giuseppe Serra, Carlo Torniai
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Effective usage of multimedia digital libraries has to deal with the problem of building efficient content annotation and retrieval tools. In this paper Multimedia Ontologies, that include both linguistic and dynamic visual ontologies, are presented and their implementation for soccer video domain is shown. The structure of the proposed ontology itself, together with reasoning, can be used to perform higher-level annotation of the clips, to generate complex queries that comprise actions and their temporal evolutions and relations and to create extended text commentaries of video sequences.
Extended Depth-Buffer Algorithms for Hidden-Surface Visualization
Authors: Norio Okino, Yukinori Kakazu, Masamichi Morimoto
Venue: IEEE Computer Graphics and Applications (1984)

Users of interactive CAD systems who are trying to cope with the hidden-surface visualization problem will want to investigate this new algorithm.
Bayesian inference explains perception of unity and ventriloquism aftereffect: Identification of common sources of audiovisual stimuli
Authors: Yoshiyuki Sato, Taro Toyoizumi, Kazuyuki Aihara
Venue: Neural Computation (2007)

We study a computational model of audiovisual integration by setting a Bayesian observer that localizes visual and auditory stimuli without presuming the binding of audiovisual information. The observer adopts the maximum a posteriori approach to estimate the physically delivered position or timing of presented stimuli, simultaneously judging whether they are from the same source or not. Several experimental results on the perception of spatial unity and the ventriloquism effect can be explained comprehensively if the subjects in the experiments are regarded as Bayesian observers who try to accurately locate the stimulus. Moreover, by adaptively changing the inner representation of the Bayesian observer in terms of experience, we show that our model reproduces perceived spatial frame shifts due to the audiovisual adaptation known as the ventriloquism aftereffect.
Convergence of the Modified Gauss-Seidel Method for H-matrices
Authors: Qingbing Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper, we present a new preconditioner which is different from the preconditioner given by Milaszewicz[1]. and prove the monotone convergence theory about this method when the coefficient matrix is an H- matrix. This directly leads to several novel sufficient conditions for guaranteeing the convergence of the preconditioned iterative method.
Counting the cost of virtual teams
Authors: Emmeline de Pillis, Kimberly Furumo
Venue: Communications of the ACM (2007)

Studying the performance, satisfaction, and group dynamics of virtual and face-to-face teams.
Musings on a Metaphysics of Modeling
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2007)

Editor-in-chief Norman Chonacky explains how CiSE magazine meets a metaphysics mandate in the world of computational science and science for engineering.
Fast and Secure Mobility for IEEE 802.16e Broadband Wireless Networks
Authors: Chung-Kuo Chang, Chin-Tser Huang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The next generation broadband wireless networks support real-time applications like VOIP and video streaming. They allow users to roam over the network seamlessly and securely. Current design incurs lengthy delay between breaking of previous connection and making of next connection. Cross layer design and cross function optimization are required to improve the handover latency of broadband wireless networks. We discuss the fast handover algorithms that combine the mechanisms in the MAC layer with that of the IP layer. Fast key exchange and fast authentication procedures are introduced to reduce authentication time during network re-entry. The effects of latency reduction by fast authentication are compared with results of other solutions. We also discuss standard activity for media independent handover in heterogeneous networks.
Programming Approaches and Challenges for Wireless Sensor Networks
Authors: Bartolome Rubio, Manuel Diaz, Jose M. Troya
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Wireless sensor networks (WSNs) constitute a new pervasive and ubiquitous technology. They have been successfully used in various application areas and in future computing environments, WSNs will play an increasingly important role. However, programming sensor networks and applications to be deployed in them is extremely challenging. It has traditionally been an error-prone task since it requires programming individual nodes, using low-level programming issues and interfacing with the hardware and the network. This aspect is currently changing as different high-level programming abstractions and middleware solutions are coming into the arena. Nevertheless, many research challenges are still open. This paper presents a survey of the current state-of-the-art in the field, establishing a classification and highlighting some likely research challenges and future directions.
A canonical model for interactive unawareness
Authors: Aviad Heifetz, Martin Meier, Burkhard C. Schipper
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Heifetz, Meier and Schipper (2006) introduced a generalized state-space model that allows for non-trivial unawareness among several individuals and strong properties of knowledge. We show that this generalized state-space model arises naturally if states consist of maximally consistent sets of formulas in an appropriate logical formulation.
Dynamic computational complexity and bit allocation for optimizing H.264/AVC video compression
Authors: E. Kaminsky, D. Grois, O. Hadar
Venue: Journal of Visual Communication and Image Representation (2008)

In this work, we present a novel approach for optimizing H.264/AVC video compression by dynamically allocating computational complexity (such as a number of CPU clocks) and bits for encoding each coding element (basic unit) within a video sequence, according to its predicted MAD (mean absolute difference). Our approach is based on a computational complexity-rate-distortion (C-R-D) analysis, which adds a complexity dimension to the conventional rate-distortion (R-D) analysis. Both theoretically and experimentally, we prove that by implementing the proposed approach for the dynamic allocation better results are achieved. We also prove that the optimal computational complexity allocation along with optimal bit allocation is better than the constant computational complexity allocation along with optimal bit allocation. In addition, we present a method and system for implementing the proposed approach, and for controlling computational complexity and bit allocation in real-time and off-line video coding. We divide each frame into one or more basic units, wherein each basic unit consists of at least one macroblock (MB), whose contents are related to a number of coding modes. We determine how much computational complexity and bits should be allocated for encoding each basic unit, and then allocate a corresponding group of coding modes and a quantization step-size, according to the estimated distortion (calculated by a linear regression model) of each basic unit and according to the remaining computational complexity and bits for encoding remaining basic units. For allocating the corresponding group of coding modes and the quantization step-size, we develop computational complexity-complexity step-rate (C-I-R) and rate-quantization step-size-computational complexity (R-Q-C) models.
Networked information management
Authors: N. J. Davies, M. C. Revett
Venue: BT Technology Journal (2007)

Every day millions of people trawl the Internet for information using any one of a dozen or more different search tools. Whether they find what they are looking for may depend not only on their skill, but also on their luck. In the corporate arena, organisations are making increasing amounts of information available via intranets. This paper looks at the limitations of current networked information management technology, in particular, shortcomings in the areas of retrieving, organising and sharing of information, and an information management process which would overcome these problems is described. The representation of a user's information needs and interests in a user profile is seen to be central to the process and work in this area, including a novel, non-explicit approach to the representation of profiles, is covered. Four information access systems developed at BT Laboratories are discussed and the extent to which these are currently able to support the information management process is considered.
Using social annotations to improve language model for information retrieval
Authors: Shengliang Xu, Shenghua Bao, Yunbo Cao, Yong Yu
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This poster is concerned with the problem of exploring the use of social annotations for improving language models for information retrieval (denoted as LMIR). Two properties of social annotations, namely keyword property and structure property are studied for this aim. The keyword property improves LMIR by concatenating all the annotations of a document to generate a summary of the document. The structure property can boost LMIR further when similarity among annotations and similarity among documents are taken into consideration simultaneously. The two properties of social annotations are leveraged for the use of language modeling with a mixture model named as "Language Annotation Model" (denoted as LAM). Evaluations using del.icio.us data show that LAM outperforms the traditional LMIR approaches significantly.