ppxscal/embedding_network huggingface dataset:
Linear CNF formulas and satisfiability
Authors: Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao
Venue: Discrete Applied Mathematics (2009)

In this paper, we study linear CNF formulas generalizing linear hypergraphs under combinatorial and complexity theoretical aspects w.r.t. SAT. We establish NP-completeness of SAT for the unrestricted linear formula class, and we show the equivalence of NP-completeness of restricted uniform linear formula classes w.r.t. SAT and the existence of unsatisfiable uniform linear witness formulas. On that basis we prove NP-completeness of SAT for uniform linear classes in a resolution-based manner by constructing large-sized formulas. Interested in small witness formulas, we exhibit some combinatorial features of linear hypergraphs closely related to latin squares and finite projective planes helping to construct rather dense, and significantly smaller unsatisfiable k-uniform linear formulas, at least for the cases k=3,4.
Transformer Fault Portfolio Diagnosis Based on the Combination of the Multiple Bayesian Classifier and SVM
Authors: Zhongli Wu, Bin Zhang, Yongli Zhu, Wenqing Zhao, Yamin Zhou
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Due to the information of test data is incomplete and deviated in the power transformer fault diagnosis, and the Bayesian network can deal with uncertainty well. The article discusses the NB(Naive Bayesian classifier), SB(Selective Bayesian classifier), TAN(Tree Augmented Naïve Bayesian), BAN(BN Augmented Naïve Bayesian classifier) and GBN(General Bayesian Network), the five Bayesian classifier models for transformer fault diagnosis, and it is proposed a new method that the combination of the multiple Bayesian network classifiers and SVM for transformer fault diagnosis. The experiments show the portfolio model that that combined of multiple Bayesian classifiers and SVM is more suitable for transformer fault diagnosis, with a capacity processing the lack of information and more fault-tolerant performance, its performance is superior to single classifier method of diagnosis.
Computers, security, and the audit function
Authors: Norman R. Nielsen
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

As the role of computation spread in the world of commercial data processing and in the world of organizational administration, concern and attention were directed toward such matters as programming techniques, computer capabilities, and computer performance measurement and evaluation. However, because computers became increasingly essential to the conduct of an organization's daily activities, and because these systems frequently controlled vast amounts of organizational resources, the computer became an object of attack. In some cases the organization was the target; the computer was the means to attack it. In other cases personal gain was the goal; the computer was merely the means for misappropriating corporate assets. Parker has chronicled more than two hundred cases of computer-related crimes. Therefore, concern has recently been focused on the security of computer installations and the maintenance of computer system integrity. In 1974 both AFIPS and the National Bureau of Standards have published guidelines for computer security.
Isolines: efficient spatio-temporal data aggregation in sensor networks
Authors: Ignacio Solis, Katia Obraczka
Venue: Wireless Communications Mobile Computing (2009)

This paper introduces an energy-efficient data collection technique that takes advantage of spatial and temporal data correlation for monitoring continuously changing conditions such as temperature, humidity, rain fall, radiation, substance concentrations, etc. The proposed technique, isoline aggregation, generates contour maps representing the condition being monitored. The resulting contour map consist of isolines which delimit regions within which the monitored condition is within a certain value range. Energy efficiency is achieved by taking advantage of the spatial and temporal correlation of the data field. Simulation results show that isoline aggregation can reduce the amount of bytes transmitted considerably. At the same time, we are able to keep high data accuracy. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Cell-based coverage management and routing protocol for wireless sensor networks
Authors: Gwo-Jong Yu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In wireless sensor network, energy efficiency and full coverage are two important design requirements. To prolong the network lifetime, large numbers of sensor nodes are deployed in the target area. In such a dense network, if all sensor nodes turn on their power simultaneously, the network will experience serious collision problem and consume lots of precious energy. On the contrary, if only few sensors turn on power, there will be lots of coverage hole existing in the target area. In this paper, a hierarchical cellular network architecture which can achieve low energy consumption and full coverage through utilization of location information is proposed. Then a routing protocol with smart slot allocation is proposed on the cellular-based network architecture and can be applied to event detection and periodical event report applications. Advantages of the proposed cell-based routing protocol include low transmission latency and low energy consumption due to properly slot assignment and data aggregation. Experimental results reveal that the proposed protocol outperforms GAF in terms of network energy consumption and data transmission latency.
A Study on Blog Based Personal Knowledge Management
Authors: Gang Li, Yi Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Personal knowledge management is an increasingly important subject in the field of knowledge management, and it has its own characteristics distinguished from organizational knowledge management. The PKM systems are required to manage personal tacit knowledge efficiently and to low down its threshold for the use for the mass people, which recent knowledge management systems cannot make. Blog, the typical web2.0 application, gives an effective approach for this problem to support PKM. A blog based PKM system is deemed to be possible and to meet the urgent needs for PKM of individuals.
Fast and accurate performance simulation of embedded software for MPSoC
Authors: Eric Cheung, Harry Hsieh, Felice Balarin
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Performance simulation of software for Multiprocessor System-on-a-Chips (MPSoC) suffers from poor tool support. Cycle accurate simulation at Instruction Set Simulation level is too slow and inefficient for any design of realistic size. Behavioral simulation, though useful for functional analysis at high level, does not provide any performance information that is crucial for design and analysis of MPSoC implementations. As a consequence, designers are often reduced to manually annotate performance information onto behavioral models, which contributes further to inefficiency and inaccuracy. In this paper, we use structural performance models to provide fast and accurate simulation of software for MPSoC. We generate structural models automatically using GCC with accurate performance annotation while considering optimizations for instruction selection, branch prediction, and pipeline interlock. Our structural models are able to simulate at several orders of magnitude faster than ISS and provide less than 1% error on performance estimation. These models allow realistic MPSoC design space explorations based on performance characteristics with simulation speed comparable to behavioral simulation. We validate our simulation models with several benchmarks and demonstrate our approach with a design case study of an MPEG-2 decoder.
Koala: a platform for OS-level power management
Authors: David C. Snowdon, Etienne Le Sueur, Stefan M. Petters, Gernot Heiser
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Managing the power consumption of computing platforms is a complicated problem thanks to a multitude of hardware configuration options and characteristics. Much of the academic research is based on unrealistic assumptions, and has, therefore, seen little practical uptake. We provide an overview of the difficulties facing power management schemes when used in real systems. We present Koala, a platform which uses a pre-characterised model at run-time to predict the performance and energy consumption of a piece of software. An arbitrary policy can then be applied in order to dynamically trade performance and energy consumption. We have implemented this system in a recent Linux kernel, and evaluated it by running a variety of benchmarks on a number of different platforms. Under some conditions, we observe energy savings of 26% for a 1% performance loss.
Night shifts: some situated dimensions of student technology use
Authors: Catherine Howell, Michael Arnold
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

The use of domestic information and communications technologies during the evenings and at nighttime is growing, yet this emergent phenomenon remains under-studied. In order to design effectively for night-time use, there is a need to understand the spatial and behavioural contexts for technology use 'after hours'. This paper describes the role of networked technologies and technological devices in the evening time-use patterns of undergraduate and postgraduate students at a research-intensive UK university. Using data obtained from two Experience Sampling Method studies, it shows how technology use permeates the flow of students' evening routines, enabling multitasking and the maintenance of social presence alongside the performance of study-related tasks. Affective dimensions of technology use in student rooms during evening hours are highlighted, and implications for the design of networked devices and information and communications services are described.
Principles of Digital Image Processing: Fundamental Techniques, 1 edition
Authors: Wilhelm Burger, Mark J. Burge
Venue:  (2009)

This easy-to-follow textbook provides a modern, algorithmic introduction to digital image processing, designed to be used both by learners desiring a firm foundation on which to build, and practitioners in search of critical analysis and modern implementations of the most important techniques. It compiles the key elements of digital image processing, starting from the basic concepts and elementary properties of digital images through simple statistics and point operations, fundamental filtering techniques, localization of edges and contours, and basic operations on color images. This reader-friendly text concentrates on practical applications and working implementations, and presents the important formal details and mathematics necessary for a deeper understanding of the algorithms. Implementations are all based on Java and ImageJ. This concise yet comprehensive, reader-friendly text is ideal for undergraduates studying foundation courses as well as ideal for self-study.
Security Software Development: Assessing and Managing Security Risks, 1 edition
Authors: CISSP,  Douglas A. Ashbaugh
Venue:  (2008)

Examining current trends and problems that have plagued application development for more than a decade, this book provides a foundation for security risk assessment and management during software development. It demonstrates how to achieve greater application security through assessing and managing risk throughout the entire software development life cycle using a test case based on the authors personal experience in software development. The book covers methods used to assess risk, discussing the pros and cons of each method. Readers are then guided through each step of the process. The book concludes with discussions of how to sustain a risk assessment and risk management process within an organization.
Varicap threshold logic
Authors: Samed Maltabas, Martin Margala, Ugur Cilingiroglu
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

In this paper, a highly compact novel Threshold Logic (TL) Gate approach called "Varicap TL (VcTL)" is proposed and described. The novel feature of the design is in using variable MOSFET capacitances which reduces the area. The electrical analysis of this variable MOSFET capacitance is presented and its variability is explained. Varicap TL (VcTL) gate is created by using a latch type decision circuit topology. Parallel counter implementations of (7,3) in 0.13µm and 0.18µm technology are realized by using proposed Varicap TL based on Minnick TL Network. Comparison of these implementations with Boolean Logic (BL) based dynamic (7,3) counter is shown. VcTL approach in 0.13µm offers 41% smaller area which is a significant result of the approach and 27% higher speed and only 24% higher power consumption compared to BL realization in 0.13µm technology. The results also show VcTL's scalability. As VcTL is scaled from 0.18µm to 0.13µm, the speed is increased by 21%, the area is decreased by 33% and power by 37%.
Embedded Wireless Homecare Monitoring System
Authors: Radu Dobrescu, Matei Dobrescu, Dan Popescu, Henri George Coanda
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

In this paper is described an embedded system for healthcare applications, actually a monitoring device for patients requiring continuous tele-monitoring treatments. The hardware architecture of the system, based on wireless communication, is discussed and implementation details are presented. We will also be presenting experimental results proving the usefulness of embedded homecare systems in providing patients with their health status monitoring.
Viewpoint Invariant Texture Description Using Fractal Analysis
Authors: Yong Xu, Hui Ji, Cornelia Fermüller
Venue: International Journal of Computer Vision (2009)

Image texture provides a rich visual description of the surfaces in the scene. Many texture signatures based on various statistical descriptions and various local measurements have been developed. Existing signatures, in general, are not invariant to 3D geometric transformations, which is a serious limitation for many applications. In this paper we introduce a new texture signature, called the multifractal spectrum (MFS). The MFS is invariant under the bi-Lipschitz map, which includes view-point changes and non-rigid deformations of the texture surface, as well as local affine illumination changes. It provides an efficient framework combining global spatial invariance and local robust measurements. Intuitively, the MFS could be viewed as a "better histogram" with greater robustness to various environmental changes and the advantage of capturing some geometrical distribution information encoded in the texture. Experiments demonstrate that the MFS codes the essential structure of textures with very low dimension, and thus represents an useful tool for texture classification.
A global optimization method for semi-supervised clustering
Authors: Yu Xia
Venue: Data Mining and Knowledge Discovery (2009)

In this paper, we adapt Tuy's concave cutting plane method to the semi-supervised clustering. We also give properties of local optimal solutions of the semi-supervised clustering. Numerical examples show that this method can give a better solution than other semi-supervised clustering algorithms do.
A project neural network for solving degenerate quadratic minimax problem with linear constraints
Authors: Xiaoping Xue, Wei Bian
Venue: Neurocomputing (2009)

In this paper, a quadratic minimax problem with linear constraints is studied. The mixed linear constraints and the degeneracy are the two significant characters of the problem considered in this paper. On the basis of the project properties and Lyapunov method, we get the complete convergence and the finite-time convergence of the proposed neural network in this paper. Moreover, we get that the nonsingular parts of the output trajectories respect to Q"1"1 and Q"2"2 are exponentially convergent. Particularly, we also give some analysis to the degenerate quadratic minimax problem without constraints. Furthermore, four illustrative examples are given to show the necessity of the matrix H in the network to solve this problem and the superiority of the network in this paper.
A Bloch band based level set method for computing the semiclassical limit of Schrödinger equations
Authors: Hailiang Liu, Zhongming Wang
Venue: Journal of Computational Physics (2009)

A novel Bloch band based level set method is proposed for computing the semiclassical limit of Schrodinger equations in periodic media. For the underlying equation, subject to a highly oscillatory initial data, a hybrid of the WKB approximation and homogenization leads to the Bloch eigenvalue problem and an associated Hamilton-Jacobi system for the phase in each Bloch band, with the Bloch eigenvalue be part of the Hamiltonian. We formulate a level set description to capture multi-valued solutions to the band WKB system, and then evaluate total homogenized density over a sample set of bands. A superposition of band densities is established over all bands and solution branches when away from caustic points. The numerical approach splits the solution process into several parts: (i) initialize the level set function from the band decomposition of the initial data; (ii) solve the Bloch eigenvalue problem to compute Bloch waves; (iii) evolve the band level set equation to compute multi-valued velocity and density on each Bloch band; (iv) evaluate the total position density over a sample set of bands using Bloch waves and band densities obtained in steps (ii) and (iii), respectively. Numerical examples with different number of bands are shown to demonstrate the capacity of the method.
Exploring Dynamic Inter-Organizational BusinessProcess Collaboration: Privacy Protecting Concepts for ChoreographingeSourcing in B2B with Service-Oriented Computing
Authors: Alex Norta
Venue:  (2008)

In B2B-collaboration, original equipmentmanufacturers are confronted with spendingconsiderable time and effort on coordinatingsuppliers across multiple tiers of their supplychain. In tightly integrated supply chains, thefailure of providing services and goods on time leadsto interruptions of the overall production andresults in customer dissatisfaction. Collaboratingparties must be able to set up aninter-organizational business process by disclosingto each other only as much as necessary. At the sametime, checking the correctness of aninter-organizational business process must not forcethe collaborating parties into revealing theirprocess internals to each other. However, in B2Bcollaborations, the ability of keeping internalbusiness activities secret is important for retaininga competitive advantage. Hence, this book proposesthe eSourcing concept for improving the coordinationof service provision across several tiers of a supplychain. eSourcing allows the external harmonization ofbusiness processes and the internal integration ofheterogeneous system environments without requiringcollaborating parties to disclose internal businessdetails to the counterparts.
Evaluation of a pervasive game for domestic energy engagement among teenagers
Authors: Anton Gustafsson, Magnus Bång
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper, we present Power Agent - a pervasive game designed to encourage teenagers and their families to reduce energy consumption in the home. The idea behind this mobile phone-based game was twofold; to transform the home environment and its devices into a learning arena for hands on experience with electricity usage and to promote engagement by means of a team competition scheme. We report on its evaluation with six teenagers and families that were playing the game for ten days in two cities in Sweden. Data collection consisted of home energy measurements before, during and after game play in addition to interviews with participants after the game session. The results suggest that the game concept was highly efficient in motivating and engaging the players and their families to change their daily energy consumption patterns during the game sessions. The study indicates that pervasive games for behavior change and learning may also be appropriate to approach related domains such as environmental conservation and lifestyle-induced health problems.
Incorporating logic exclusivity (LE) constraints in noise analysis using gain guided backtracking method
Authors: Ruiming Li, An-Jui Shey, Michel Laudes
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Crosstalk noise becomes one of the critical issues gating design closure for nano-meter designs. Pessimism in noise analysis can lead to significant additional time spent addressing false violations. Taking logic correlation into consideration, noise analysis can reduce pessimism significantly by eliminating false noise signals [1]-[3][5]-[7][10]-[13]. Eliminating the aggressors from the aggressor candidate set that can not switch simultaneously restricted by the logic exclusivity (LE) relationship among them can save simulation time as well. The LE problem, being proved as NP-complete, is basically to determine the subset (possibly multiple equivalent subsets) of a given aggressor candidate set which has the largest combined weight out of all possible subsets governed by logic exclusivity constraints. This paper presents a new approach in resolving the LE problem, which employs a gain guided backtrack search technique that does not require exhaustive search of all the binary paths to reach an optimal solution. We first prove that under certain conditions, if the gain at each level is non-negative, then the result will be optimal. Based on this theorem, a new algorithm is developed. The experimental results demonstrate the efficiency and accuracy of this approach. The algorithm can quickly find the optimal solutions for most cases from industry designs and outperforms other methods.
Data base management
Authors: E. F. Codd
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Data base management is in a state of ferment due to the emergence within the past few years of many new requirements. Amongst these requirements are the need to make application programs and terminal activities much more independent of the internal representation of data in storage, and the need to support: 1. many different kinds of end users at terminals (some interactions being of unpredictable scope and complexity); 2. greatly enhanced data security and privacy; 3. increased dynamic sharing of data (including concurrent update and enquiry); 4. networks of mutually remote data bases (including very high level data sublanguages for low bandwidth communication of requests).