ppxscal/embedding_network huggingface dataset:
From data privacy to location privacy: models and algorithms
Authors: Ling Liu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This tutorial presents the definition, the models and the techniques of location privacy from the data privacy perspective. By reviewing and revising the state of art research in data privacy area, the presenter describes the essential concepts, the alternative models, and the suite of techniques for providing location privacy in mobile and ubiquitous data management systems. The tutorial consists of two main components. First, we will introduce location privacy threats and give an overview of the state of art research in data privacy and analyze the applicability of the existing data privacy techniques to location privacy problems. Second, we will present the various location privacy models and techniques effective in either the privacy policy based framework or the location anonymization based framework. The discussion will address a number of important issues in both data privacy and location privacy research, including the location utility and location privacy trade-offs, the need for a careful combination of policy-based location privacy mechanisms and location anonymization based privacy schemes, as well as the set of safeguards for secure transmission, use and storage of location information, reducing the risks of unauthorized disclosure of location information. The tutorial is designed to be self-contained, and gives the essential background for anyone interested in learning about the concept and models of location privacy, and the principles and techniques for design and development of a secure and customizable architecture for privacy-preserving mobile data management in mobile and pervasive information systems. This tutorial is accessible to data management administrators, mobile location based service developers, and graduate students and researchers who are interested in data management in mobile information syhhhstems, pervasive computing, and data privacy.
Design Considerations for Digital Image Processing Systems
Authors: J. M. Booth
Venue: Computer (1977)

The brightness levels in a scene or image, together with the spatial relationships among these levels, comprise the total input and output data available to the digital image processor. Indeed, in any mathematical image processing operation, these are the elements of the image which are being manipulated and which represent the major concern of the image processing professional. However, many other factors affect image brightness relations and can distort or obscure the outcome of any image processing experiment. These factors, which consist of a long chain of transmitters, transducers, signal conditioners and processors, are in aggregate commonly called the image chain. An understanding of the image chain is essential to the design of image processing systems.
Filtering unsatisfiable XPath queries
Authors: Jinghua Groppe, Sven Groppe
Venue: Data Knowledge Engineering (2008)

The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submission and the computation of unsatisfiable queries. Thus, applying the satisfiability test before executing a query can save processing time and query costs. We focus on the satisfiability problem for queries formulated in the XML query language XPath, and propose a schema-based approach to the satisfiability test of XPath queries, which checks whether or not an XPath query conforms to the constraints in a given schema. If an XPath query does not conform to the constraints given in the schema, the evaluation of the query will return an empty result for any valid XML document. Thus, the XPath query is unsatisfiable. We present a complexity analysis of our approach, which proves that our approach is efficient for typical cases. We present an experimental analysis of our developed prototype, which shows the optimization potential of avoiding the evaluation of unsatisfiable queries.
Minis in Business: an International Perspective
Authors: T. G. Lewis
Venue: Computer (1976)

This special issue on minicomputer systems in business is motivated by my personal philosophy of computing. I call this philosophy the common computer attitude. This attitude has come about because systems are being dispersed into local standalone systems or as local stations that are part of networked mini/microcomputer systems. The user is less knowledgeable and yet intensely involved in such local computing.
An Optimal Orthogonal Expansion for Classification of Patterns
Authors: Y. Nakamura
Venue: IEEE Transactions on Computers (1977)

In this correspondence, the Karhunen-Loève expansion is generalized for multiclass classification and some optimal properties desirable for the feature extraction process are proved. This expansion is based upon a weighted covariance matrix with the interclass and intraclass distances.
High Speed, Low Memory Image Coding Using Zero blocks of Wavelet Coefficients
Authors: Wei-guo Yang, Tao Zhang, Jian-dong Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

We propose a new high speed, low memory SPECK image coder based on the form of block-unit states, called LBUS-SPECK, which uses the form of block-unit states and the form of block exponents to substitute LIS and LSP of SPECK. A form of block-unit states is introduced to store the significance flag of coefficients and the value of the block-unit exponents. A form of block exponents is introduced to store the block exponents which are used to represent the max coefficient in a decomposed block. A new block depth-finding strategy is developed for searching insignificant sets at sorting stage. Experimental results show that the obtained PSNR values for the decoded images are very close to those of SPECK algorithm and the memory consumption is reduced by 9 times, the encoding timing is saved about 15%. Comparing with SPECK algorithm, this algorithm not only has better performance of the decoded images, but also is easy to implement, especially, it provides an efficient way for hardware implementation of wavelet embedded block coding.
Prediction to the Weak Electrical Signal in Chrysanthemum by RBF Neural Networks
Authors: Jinli Ding, Miao Wang, Lanzhou Wang, Qiao Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Taking electrical signals in the chrysanthemum (Dendranthema morifolium) as the time series and using the Gaussian radial base function (RBF) and a delayed input window chosen at 50, an intelligent RBF forecast system is set up to forecast signals by the wavelet soft-threshold de-noised backward. It is obvious that the electrical signal in chrysanthemum is a sort of weak, unstable and low frequency signals. There is the maximum amplitude at 1093.44ìV, minimum -605.35ìV, average value -11.94ìV; and below 0.3Hz at frequency in the chrysanthemum respectively. A result shows that it is feasible to forecast plant electrical signals for the timing by using of the RBF neural network. The forecast data can be used as the important preferences for the intelligent automatic control system based on the adaptive characteristic of plants to achieve the energy saving on the agricultural production in the greenhouse and /or the plastic lookum.
The end of an architectural era: (it's time for a complete rewrite)
Authors: Michael Stonebraker, Samuel Madden, Daniel J. Abadi, Stavros Harizopoulos, Nabil Hachem, Pat Helland
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In previous papers [SC05, SBC+07], some of us predicted the end of "one size fits all" as a commercial relational DBMS paradigm. These papers presented reasons and experimental evidence that showed that the major RDBMS vendors can be outperformed by 1--2 orders of magnitude by specialized engines in the data warehouse, stream processing, text, and scientific database markets. Assuming that specialized engines dominate these markets over time, the current relational DBMS code lines will be left with the business data processing (OLTP) market and hybrid markets where more than one kind of capability is required. In this paper we show that current RDBMSs can be beaten by nearly two orders of magnitude in the OLTP market as well. The experimental evidence comes from comparing a new OLTP prototype, H-Store, which we have built at M.I.T. to a popular RDBMS on the standard transactional benchmark, TPC-C. We conclude that the current RDBMS code lines, while attempting to be a "one size fits all" solution, in fact, excel at nothing. Hence, they are 25 year old legacy code lines that should be retired in favor of a collection of "from scratch" specialized engines. The DBMS vendors (and the research community) should start with a clean sheet of paper and design systems for tomorrow's requirements, not continue to push code lines and architectures designed for yesterday's needs.
ElephantTrap: A low cost device for identifying large flows
Authors: Yi Lu, Balaji Prabhakar, Flavio Bonomi
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

This paper describes the design of ElephantTrap, a device which aims to cache the largest flows (the "elephants") on a network link. ElephantTrap differs from previous work on identifying large flows in one crucial sense: it does not attempt to accurately estimate the size of the flows it is trapping. This leads to an extremely lightweight design and a surprisingly good performance. ElephantTrap can be employed in the line cards of switches and routers and be used for diagnostics, anomaly detection and traffic engineering.
A Study of a Mechanism for Controlling Multiprogrammed Memory in an Interactive System
Authors: A. Brandwajn
Venue: IEEE Transactions on Software Engineering (1981)

This paper deals with the following mechanism for controlling the multiprogramming set in a demand paging system: processes are dynamically divided into several categories according to the number of page faults generated during their residence in main memory. A process is admitted into the multiprogramming set only if there is enough space free in the main memory to contain the number of pages corresponding to the current category of the process. Using a queueing network model of an interactive system with such a control mechanism we study the effectivenesss of the control considered, and, more particularly, its ability to partition the memory space according to the locality of processes.
A neural network approach for estimating examinees' proficiency levels in computerized adaptive testing
Authors: El-Sayed M. El-Alfy, Syed Shomaail Jafri
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper studies the potential of using neural network models for estimating examinees' proficiency levels in computerized adaptive testing. Computerized adaptive testing (CAT) has recently become increasingly important to standardized testing. An essential constituent of CAT is the estimation of each examinee proficiency level. Previously, this estimation has been carried out using the maximum likelihood estimator (MLE) or a Bayesian procedure. As being parametric techniques, the quality of estimates strongly depends on some restrictive assumptions. Neural network, with its strong theoretical background and ability to learn and generalize, provides a more flexible non-parametric function approximation and tends to be more efficient in estimation accuracy. It can be used for estimating the proficiency levels of examinees. In this work, several models have been simulated and compared namely multi-layer perceptron (MLP), principal-component analysis (PCA), radial-basis function (RBF) and support-vector machines (SVM). Simulation results reveal that neural-network models are capable of providing good estimates of examinees' proficiecy levels. The accuracy of the classification estimation varies based on the network complexity and the size of the training data set.
On the Latency Efficiency of Message-Parsimonious Asynchronous Atomic Broadcast
Authors: Dan Dobre, HariGovind V. Ramasamy, Neeraj Suri
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

We address the problem of message-parsimonious asynchronous atomic broadcast when a subset t out of n parties may exhibit Byzantine behavior. Message parsimony involves using only the optimal O(n) message exchanges per atomically delivered payload in the normal case. Message parsimony is desirable for Internet-like deployment environments in which message loss rates are non-negligible. Protocol PABC, the only previously-known message-parsimonious solution, suffered from two limitations vis-`a-vis the solutions with O(n2) message complexity: more communication steps and the use of digital signatures. We present a protocol termed AMP that for the first time provides signature-free message parsimony while at the same time reducing the number of communication steps to the minimum necessary. In contrast to many previous atomic broadcast solutions, our protocol satisfies both safety and liveness in the asynchronous model.
Methods for the Measurement of Memory Utilization and the Improvement of Program Locality
Authors: T. Masuda
Venue: IEEE Transactions on Software Engineering (1979)

It is known that the locality of reference of a program can be improved by restructuring it. One approach for program restructuring is to rearrange the order of relocatable program sectors and to repackage those sectors of a program, that are needed within a relatively short time of one another, into the same virtual page. This approach needs no reprogramming of the source program. However, microscopic analysis of the internal structure of repackaged sectors often shows the existence of sectors only few portions of which are actually referenced while the sectors are in use.
Plagiarism, Graduate Education, and Information Security
Authors: Julie J. C. H. Ryan
Venue: IEEE Security and Privacy (2007)

Anecdotal evidence suggests that plagiarism is commonplace in graduate schools and workplaces, and perhaps becoming even more widespread as the Internet makes it easy to accomplish. Even when confronted with real-world examples of plagiarism and consequences, students tend to interpret the activities in terms of legal technicalities rather than intellectual honesty. Such attitudes are disturbing in the academic context, but they're even more disturbing in the context of innovation, intellectual property development, competency assessment, and global competitiveness. This article presents a call to arms to confront the problem.
Common p-belief and uncertainty
Authors: Jayant V Ganguli
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

This note generalizes the notion of common p-beliefs to situations of ambiguity or Knightian uncertainty. When players have multiple prior beliefs, we show that Aumann's no-agreement theorem can be approximated. We also provide conditions under which purely speculative trade does not occur in the presence of ambiguity when players preferences are complete or incomplete.
A fuzzy set approach to resource procurement for multi-phase projects subject to flexible budgetary constraints
Authors: A. de Korvin, R. Kleyle
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In this paper we devise an algorithm for the selection of personnel for a multiple phase project which takes into account the match between the skills possessed by the personnel, the skills needed for each phase, and rather flexible budget considerations. This algorithm uses several fuzzy constructs&colon; compatibility, degree of equality, and the necessity of a set given a fuzzy set of available capital.
XMS: A Rendezvous-Based Distributed System Software Architecture
Authors: N. Gammage
Venue: IEEE Software (1985)

XMS creates a single, powerful system from loosely coupled microcomputers. Programs work together across nodes, making systemwide resource management transparent and distributed-system design simpler.
Approximation Algorithm for Process Mapping on Network Processor Architectures
Authors: C. Ostler
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, and block multi-threading. The paper presents an automated system-level design technique for process mapping on such architectures with an objective of maximizing the worst case throughput of the application. As this mapping must be done in the presence of resource (processors and code size) constraints, this is an NP-complete problem (Ausiello et al., 1999). We present a polynomial time approximation algorithm guaranteed to generate solutions with throughput at least 1/2 that of optimal solutions. The proposed algorithm was utilized to map realistic applications on the Intel IXP2400 (NP) architecture, and produced solutions within 78% of optimal.
Discrete-continuous project scheduling with discounted cash flows-A tabu search approach
Authors: Grzegorz Waligóra
Venue: Computers and Operations Research (2008)

In this paper discrete-continuous project scheduling problems with discounted cash flows are considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. The processing rate of an activity depends on the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. Two common payment models-lump-sum payment and payments at activities' completion times-are considered. The objective is the maximization of the net present value of all cash flows of the project. Some properties of optimal schedules are discussed, and the formulation of a mathematical programming problem for an optimal continuous resource allocation is presented. Applications of a local search metaheuristic-tabu search, as well as simple search methods-multi-start iterative improvement and random sampling are described. The algorithms are compared on the basis of a computational experiment, the results are analyzed and discussed. Some conclusions as well as directions for further research are given.
Quantum Storage Network
Authors: Rigui Zhou, Yongzhong Cao, Shuqun Yang, Xinwei Xu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Quantum Neural Network (QNN) is a young and outlying science built upon the combination of classical neural network and quantum computing.Making the best of some characteristics of the quantum operators,this paper presents both the network structure of Quantum Storage Network (QSN) and its corresponding pattern storage algorithm.QSN can store quantum patterns by a series of quantum unitary operators and its storage capacity or memory capacity is exponentially increased. Besides,the case analysis validates the feasibility and validity of the QSN proposed in this paper.
Applying models of visual search to map display design
Authors: Joshua Shive, Gregory Francis
Venue: International Journal of Human-Computer Studies (2008)

We explored how to use a computational model of visual search to design a map of a mall directory. We parameterized the Guided Search model [Wolfe, J.M., 1994. Guided Search 2.0: a revised model of visual search. Psychonomic Bulletin and Review 1(2), 202-238] for a task involving visual search of a target store in a map. The resulting model was then used to choose color assignments for all the elements of the display that would result in the fastest average search time for the display and search tasks. These predicted optimized color assignments were then tested empirically. The empirical data closely matched the predicted pattern of search times. We conclude that computational models of visual search are sophisticated enough to contribute to the development of optimized map designs, discuss some limitations of the current models, and suggest directions for further development.
Improving Data Accessibility with File Area Networks
Authors: David Geer
Venue: Computer (2007)

To manage their complex information systems, many companies are turning to the use of file area networks, a new file-management approach.
Dopant effects on the thermal stability of FUSI NiSi
Authors: P. Zhao, M. J. Kim, B. E. Gnade, R. M. Wallace
Venue: Microelectronic Engineering (2008)

The thermal stability of fully silicided (FUSI) NiSi with arsenic or boron doping on silicon on insulator (SOI) was investigated. After the stacks were subjected to a typical back-end of line (BEOL) thermal annealing in a N"2 ambient, abnormal oxidation of As doped FUSI NiSi stacks is observed by X-ray photoelectron spectroscopy (XPS), and confirmed by high-resolution transmission electron microscopy (HRTEM). X-ray diffraction (XRD) results show Ni-rich phases like Ni"3Si are formed due to abnormal oxidation of FUSI NiSi. In contrast to As doped stacks, no phase transformation nor abnormal oxidation are observed for B doped stacks under similar annealing. However, backside secondary ion mass spectrometry (SIMS) results indicate B penetration through a 3nm SiON layer into the Si channel after N"2 annealing for 4h at 400^oC. There is no evidence for Ni diffusion into the Si channel for B doped stacks. However, Ni penetration into the Si channel is observed for As doped stacks due to the enhancement of abnormal oxidation of FUSI NiSi.
A Fast Algorithm for the Disjunctive Decomposition of Switching Functions
Authors: V. Yun-Shen Shen, A. C. McKellar, P. Weiner
Venue: IEEE Transactions on Computers (1971)

An algorithm for obtaining all simple disjunctive decompositions of a switching function is described. It operates on a function given as an expression using the operations AND, EXCLUSIVE OR, and complementation. It uses necessary conditions for the existence of a decomposition to eliminate sets of bound sets from consideration. Thus this technique differs from existing methods in that it attempts
Reconstruction of a High Dynamic Range and High Resolution Image from a Multisampled Image Sequence
Authors: Harald B. Haraldsson, Masayuki Tanaka, Masatoshi Okutomi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This research proposes a framework for reconstructing an image of high dynamic range and high spatial resolution from a sequence of multisampled images. In the framework, there are two key issues: robust motion estimation and appropriate measurement discarding for reconstruction. An approach to increase the robustness of motion estimation for a multisampled image sequence is presented. By extracting the luminance component from each captured image in the sequence, and then enhancing the low intensity regions, conventional motion estimation methods can be applied with good results. The research also presents a novel discarding method of invalid measurements. The proposed spatio-temporal discarding method prevents overdiscarding in the case of extreme exposure differences. Experimental results show the effectiveness of the proposed framework.
Boundary Points of Threshold Functions
Authors: L. T. Fisher
Venue: IEEE Transactions on Computers (1973)

Boundary points of a threshold function fare those vertices of the n-cube that produce a minimal irredundant set of inequalities for the realization of f. In this paper they are shown to be those vertices that can be contained in separating hyperplanes. With this theorem it is shown that knowledge of canonical boundary points of self-dual canonical threshold functions allows complete determination of boundary points of equivalent functions. This provides a compact and geometrically interesting characterization of threshold functions.