ppxscal/embedding_network huggingface dataset:
Compact Access Control Labeling for Efficient Secure XML Query Evaluation
Authors: Huaxin Zhang, Ning Zhang, Kenneth Salem, Donghui Zhuo
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Fine-grained access controls for XML define access privileges at the granularity of individual XML nodes. In this paper, we present a fine-grained access control mechanism for XML data. This mechanism exploits the structural locality of access rights as well as correlations among the access rights of different users to produce a compact physical encoding of the access control data. This encoding can be constructed using a single pass over a labeled XML database. It is block-oriented and suitable for use in secondary storage. We show how this access control mechanism can be integrated with a next-of-kin (NoK) XML query processor to provide efficient, secure query evaluation. The key idea is that the structural information of the nodes and their encoded access controls are stored together so the access privileges can be checked efficiently. Our evaluation shows that the access control mechanism introduces little overhead into the query evaluation process.
Distribution sort with randomized cycling
Authors: Jeffrey Scott Vitter, David Alexander Hutchinson
Venue: Journal of the ACM (JACM) (2006)

Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often difficult. Each disk can service only one read or write request at a time; the challenge is to keep the disks as busy as possible. In this article, we develop a randomized allocation discipline for parallel independent disks, called randomized cycling. We show how it can be used as the basis for an efficient distribution sort algorithm, which we call randomized cycling distribution sort (RCD). We prove that the expected I/O complexity of RCD is optimal. The analysis uses a novel reduction to a scenario with significantly fewer probabilistic interdependencies. We demonstrate RCD's practicality by experimental simulations. Using the randomized cycling discipline, algorithms developed for the unrealistic multihead disk model can be simulated on the realistic parallel disk model for the class of multipass algorithms, which make a complete pass through their data before accessing any element a second time. In particular, algorithms based upon the well-known distribution and merge paradigms of EM computation can be optimally extended from a single disk to parallel disks.
Rational Acceptance and Conjunctive/Disjunctive Absorption
Authors: Gregory Wheeler
Venue: Journal of Logic, Language and Information (2006)

A bounded formula is a pair consisting of a propositional formula ¿ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of ¿. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference.
A fast learning algorithm for deep belief nets
Authors: Geoffrey E. Hinton, Simon Osindero, Yee-Whye Teh
Venue: Neural Computation (2006)

We show how to use "complementary priors" to eliminate the explaining-away effects that make inference difficult in densely connected belief nets that have many hidden layers. Using complementary priors, we derive a fast, greedy algorithm that can learn deep, directed belief networks one layer at a time, provided the top two layers form an undirected associative memory. The fast, greedy algorithm is used to initialize a slower learning procedure that fine-tunes the weights using a contrastive version of the wake-sleep algorithm. After fine-tuning, a network with three hidden layers forms a very good generative model of the joint distribution of handwritten digit images and their labels. This generative model gives better digit classification than the best discriminative learning algorithms. The low-dimensional manifolds on which the digits lie are modeled by long ravines in the free-energy landscape of the top-level associative memory, and it is easy to explore these ravines by using the directed connections to display what the associative memory has in mind.
Checking order-insensitivity using ternary simulation in synchronous programs
Authors: M. Yeddes
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

In synchronous systems, new asynchronous distribution schemes are introduced. Properties can be established in order to distribute a program with weak synchronization. This paper deals with automatic verification of the order-insensitive property. Order-insensitivity is an important property introduced in synchronous systems by analogy with delay-insensitivity in asynchronous hardware. An algorithm derived from the Eichelberger ternary algorithm in combinational and sequential switching circuits is given. The new ternary algorithm allows exact detection of order-insensitive property violation. Binary analyses which are conceptually simple and natural, can solve the verification of the order-insensitive property. However, this technique is exponential in the number of state variable computations. By analogy with asynchronous systems, ternary techniques are polynomial in the number of state variable computations. Our goal is to verify if a transition function describing a synchronous program is order-insensitive. Thus, the introduction of an uncertain value in addition to Boolean values allows concretization of the insensitivity introduced by the chaotic order of state variables processing in a distributed way (sequential processing).
Sustaining and scaling innovations in Singapore schools: issues for school-based learning sciences research
Authors: Chee-Kit Looi, Wei-Ying Lim
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This paper reviews some of the issues associated with scalability and sustainability of educational innovations in schools, and grounds the discussion by basing it on case studies of two innovations, Knowledge Forum (KF) and Knowledge Community (KC) which have been implemented in Singapore schools. We propose that school-based learning sciences research which plans for sustainable and scalable outcomes, needs to consider three key issues: Design, Deploy and Discern. Design of research projects can take an expansive approach, considering outcomes from both the learning and the sustainability and scalability perspectives. In the deployment of the research projects, an effective professional development model is needed so that learning science researchers and practitioners can deepen their understanding of each other's context and perspectives. Discerning adaptability and scalability of innovations requires new methods of analysis which is another important research frontier.
Full potential investigations of structural and electronic properties of ZrSiO4
Authors: R. Terki, G. Bertrand, H. Aourag
Venue: Microelectronic Engineering (2005)

The full-potential linearized augmented plane wave (FP-LAPW) method within the density functional theory is used to investigate the structural and electronic properties of ZrSiO"4 in its low pressure phase (zircon). In this approach, the generalized gradient approximation was used for the exchange-correlation potential. We have firstly optimized the internal parameters and used them to calculate the ground state properties such as lattice constants, bulk modulus and its derivative as well as inter-atomic distances. Calculations of band structure, density of state and charge density are also performed to describe the orbital mixing and the nature of chemical bonding. Additionally, using a set of total energy versus volume obtained with the FP-LAPW, The quasi-harmonic Debye model is applied to determine the thermal properties such as temperature dependence of bulk modulus, thermal expansion coefficient, specific heats at constant volume and constant pressure. The obtained results tend to support the experimental data when available.
Deriving quantitative models for correlation clusters
Authors: Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a common arbitrarily oriented hyperplane of arbitrary dimensionality. Several algorithms for this task have been proposed recently. However, all algorithms only compute the partitioning of the data into clusters. This is only a first step in the pipeline of advanced data analysis and system modelling. The second (post-clustering) step of deriving a quantitative model for each correlation cluster has not been addressed so far. In this paper, we describe an original approach to handle this second step. We introduce a general method that can extract quantitative information on the linear dependencies within a correlation clustering. Our concepts are independent of the clustering model and can thus be applied as a post-processing step to any correlation clustering algorithm. Furthermore, we show how these quantitative models can be used to predict the probability distribution that an object is created by these models. Our broad experimental evaluation demonstrates the beneficial impact of our method on several applications of significant practical importance.
XML Constraint-tree-based Functional Dependencies
Authors: Teng Lv, Ping Yan
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

A concept of functional dependency in XML documents based on constraint-tree is proposed. The definition proposed in our paper overcomes the shortcomings of previous definitions in the following aspects: (1) it captures the tree-structured characteristics of XML documents in structure. (2) it considers a more general situation of XML functional dependencies based on sub-trees with some constraint conditions in XML documents. The relationship between our definition of XML functional dependencies and other related definitions is also discussed in the paper.
Optimal kernels for Wigner-Ville spectral estimation
Authors: A. M. Sayeed, D. L. Jones
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Current theories of a time-varying spectrum of a nonstationary process all involve, either by definition or by implementation, an assumption that the signal statistics vary slowly over time. This restrictive quasi-stationarity assumption limits the use of existing estimation techniques to a small class of nonstationary processes. We overcome this limitation by deriving a statistically optimal kernel, within Cohen's (1989) class of time-frequency representations, for estimating the Wigner-Ville spectrum of a nonstationary process. Both time-frequency invariant and time-frequency varying kernels are derived. It is shown that, in the presence of any noise, optimal performance requires a nontrivial kernel, and that optimal estimation may require smoothing filters very different from those based on a quasi-stationarity assumption. An example illustrates that the optimal estimators can potentially yield tremendous improvements in performance over existing methods.
Beyond transparency: how students make representations meaningful
Authors: Victor R. Lee, Bruce Sherin
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In current science education reform, two criteria are considered most critical for determining whether or not an external representation is pedagogically productive. One is whether or not the representation maintains a high level of epistemic fidelity. The other is whether or not the representation is transparent relative to the content it is supposed to represent. We believe that these criteria are too limited in scope and have been considered acceptable in part because we have a very limited understanding of how students construct meaningful interpretations of unfamiliar representations. To remedy that, we propose a new framework for understanding acts of interpretation that focuses on four major constructs: registrations, symbolic forms, interpretive genres, and interpretive maxims. We demonstrate this framework's utility by applying it to excerpts of middle school students interpreting unfamiliar representations of light reflection.
Enhanced Recommendations through Propagation of Trust and Distrust
Authors: Patricia Victor, Chris Cornelis, Martine De Cock
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The incorporation of a trust network among the users of a recommender system (RS) proves beneficial to the quality and amount of recommendations. Involving also distrust can offer additional clues how to handle specific recommendations as well as protection against recommendation attacks, yet this direction has not been thoroughly explored so far. In this paper, we advocate the use of a trust model for RSs in which trust scores are (trust,distrust)-couples, drawn from a bilattice. We design an experimental setup to get insight into the trust propagation problem in a movie RS and propose two trust score propagation operators, each reflecting a distinct user behaviour pattern or profile.
Implications of a Formative Evaluation for Improving the Educational Effectiveness of an Educational Game for Spanish Orthography
Authors: Cristina Carmona, Eva Millan
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

An educational game is a recreational activity designed to teach people, typically children, about a certain subject or help them learn a skill as they play. These games are usually successful in engagement, but sometimes fail in triggering learning. This paper shows the results obtained when evaluating MITO, an educational game to teach Spanish orthography. This experiment let us find the main deficiencies of MITO and opens a new line of work that tries to fix them.
Dissociating Reading Processes on the Basis of Neuronal Interactions
Authors: Andrea Mechelli, Jennifer T. Crinion, Steven Long, Karl J. Friston, Matthew A. Lambon Ralph, Karalyn Patterson, James L. Mcclelland, Cathy J. Price
Venue: Journal of Cognitive Neuroscience (2005)

Previous studies of patients with phonological and surface alexia have demonstrated a double dissociation between the reading of pseudo words and words with atypical spelling-to-sound relationships. A corresponding double dissociation in the neuronal activation patterns for pseudo words and exception words has not, however, been consistently demonstrated in normal subjects. Motivated by the literature on acquired alexia, the present study contrasted pseudo words to exception words and explored how neuronal interactions within the reading system are influenced by word type. Functional magnetic resonance imaging was used to measure neuronal responses during reading in 22 healthy volunteers. The direct comparison of reading pseudo words and exception words revealed a double dissociation within the left frontal cortex. Pseudo words preferentially increased left dorsal premotor activation, whereas exception words preferentially increased left pars triangularis activation. Critically, these areas correspond to those previously associated with phonological and semantic processing, respectively. Word-type dependent interactions between brain areas were then investigated using dynamic causal modeling. This revealed that increased activation in the dorsal premotor cortex for pseudo words was associated with a selective increase in effective connectivity from the posterior fusiform gyrus. In contrast, increased activation in the pars triangularis for exception words was associated with a selective increase in effective connectivity from the anterior fusiform gyrus. The present investigation is the first to identify distinct neuronal mechanisms for semantic and phonological contributions to reading.
Proportional Nested Deficit Round Robin: Improving the Latency of Packet Scheduler with an O(1) Complexity
Authors: Afshin Shiravi, Yoon G. Kim, Paul S. Min
Venue: Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)

In recent years, many fair Packet scheduling algorithms have been proposed for switches and routers to provide the Quality of Service (QoS) guarantees required by many applications. In addition to the fairness and low end-to-end delay that these algorithms have to have, simplicity and scalability are two significant factors that play an important role. In this paper, we present a new scheduling discipline called Proportional Nested Deficit Round Robin (PNDRR), which has a low latency and reduces burstiness. PNDRR is a class of Nested-DRR in which each DRR round is split into some smaller inner rounds. However, unlike Nested-DRR, flows receive credits proportional to their deficit counters in each inner round. PNDRR takes advantage of the input traffic pattern and decreases the serving size of flows when the input traffic contains many small packets. This helps to interleave packets in many practical scenarios, such as the Internet, where the majority of packets are relatively small. The latency and fairness of PNDRR are studied and compared to other algorithms using simulation. PNDRR has a per-packet computational complexity of O(1).
Agent Teams in Cyberspace: Security Guards in the Global Internet
Authors: Igor Kotenko, Alexander Ulanov
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

The paper presents an approach to design a cyberworld intended for the research of security systems functioning in the Internet. These systems are represented as the complex of various interacting teams of intelligent agents. The agents can be in the state of antagonistic counteraction or cooperation. The general conceptual model of agent teams' antagonistic counteraction and cooperation is suggested. The task of developing the agent cyberworld, where agents realize the distributed attacks and defense, is investigated on the example of "distributed denial of service" attack subject domain. The architecture and implementation of research environment for agentoriented simulation is presented. The environment is implemented on the basis of discrete-event simulation system that allowed to combine the agent-oriented and network protocol based simulation.
System and statistical computer simulation of periodic physiological rhythms using cosinor analysis
Authors: E. B. Senyuk, L. I. Yasinskaya
Venue: Cybernetics and Systems Analysis (2006)

A mathematical model is proposed for describing periodical physiological rhythms using cosinor analysis. Computer statistic analysis is performed for periodic processes of cosine and complex forms with known periods using the least squares method and for several harmonics using Fourier analysis.
Foreign Code Detection on the Windows/X86 Platform
Authors: Susanta Nanda, Wei Li, Lap-Chung Lam, Tzi-cker Chiueh
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

As new attacks againstWindows-based machines emerge almost on a daily basis, there is an increasing need to "lock down" individual users' desktop machines in corporate computing environments. One particular way to lock down a user computer is to guarantee that only authorized binary programs are allowed to run on that computer. A major advantage of this approach is that binaries downloaded without the user's knowledge, such as spyware, adware, or code entering through buffer overflow attacks, can never run on computers that are locked down this way. This paper presents the design, implementation and evaluation of FOOD, a foreign code detection system specifically for the Windows/X86 platform, where foreign code is defined as any binary programs that do not go through an authorized installation procedure. FOOD verifies the legitimacy of binary images involved in process creation and library loading to ensure that only authorized binaries are used in these operations. In addition, FOOD checks the target address of every indirect branch instruction in Windows binaries to prevent illegitimate control transfers to either dynamically injected mobile code or pre-existing library functions that are potentially damaging. Combined together, these techniques strictly prevent the execution of any foreign code. Experiments with a fully working FOOD prototype show that it can indeed stop all spyware and buffer overflow attacks we tested, and its worst-case run-time performance overhead associated with foreign code detection is less than 35%.
Computer Vision, Image Analysis, and Master Art: Part 1
Authors: David G. Stork
Venue: IEEE MultiMedia (2006)

Can computer systems help us understand paintings and the methods of great masters? In thisthree-part series, David G. Stork describes how he uses techniques adapted from computer vision and imageanalysis to shed light on art and problems in art history. In part 1, the subject is perspective, and amongthe questions posed: Did the artists of the Renaissance use optical projections as has been recentlyhypothesized?
Efficient Sampling Startup for SimPoint
Authors: Michael Van Biesbrouck, Brad Calder, Lieven Eeckhout
Venue: IEEE Micro (2006)

Sampling techniques dramatically shorten simulation times for industry-standard benchmarks, but establishing the correct architecture and microarchitecture states at the beginning of each sample can be time-consuming. This article compares the accuracy and speed of various sampling startup techniques, introducing touched memory image and memory hierarchy state. Together, these two techniques reduce sampled benchmark simulation times from hours to minutes.
TLM node with arbitrary embedded objects: Research Articles
Authors: Konrad Biwojno, Chris Smartt, Phillip Sewell, Yafang Liu, Christos Christopoulos
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

This contribution is an extension of the authors' work in modelling multi-scale systems which are of significant importance in many applications such as Electromagnetic Compatibility (EMC). By its very nature EMC analysis often requires consideration of systems characterized by many different physical scales, for example when thin wires, gaps and slots are present in otherwise physically large structures. For the Transmission Line Modelling (TLM) simulation method, nodes that explicitly embed fine structures smaller than the mesh size within them have previously been demonstrated for a number of special cases where the fields in close proximity to the object may be represented in terms of known local analytic solutions. This approach enables the presence of general sub cell objects to be correctly and efficiently modelled in coarse grids without incurring excessive computational effort. The work presented here differs in that it permits the use of purely numerical calculations of these local fields and therefore provides a powerful extension to more general structures for which local analytic field representations are unavailable. A full derivation of the formulation in terms of these local solutions is discussed as well as the procedure for linking them to the rest of the numerical network. Illustrative results are then obtained from an application to a canonical scattering problem. Copyright &copy; 2006 John Wiley & Sons, Ltd.