ppxscal/embedding_network huggingface dataset:
Query suggestions using query-flow graphs
Authors: Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Sebastiano Vigna
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

The query-flow graph [Boldi et al., CIKM 2008] is an aggregated representation of the latent querying behavior contained in a query log. Intuitively, in the query-flow graph a directed edge from query qi to query qj means that the two queries are likely to be part of the same search mission. Any path over the query-flow graph may be seen as a possible search task, whose likelihood is given by the strength of the edges along the path. An edge (qi, qj) is also labelled with some information: e.g., the probability that user moves from qi to qj, or the type of the transition, for instance, the fact that qj is a specialization of qi. In this paper we propose, and experimentally study, query recommendations based on short random walks on the query-flow graph. Our experiments show that these methods can match in precision, and often improve, recommendations based on query-click graphs, without using users' clicks. Our experiments also show that it is important to consider transition-type labels on edges for having good quality recommendations. Finally, one feature that we had in mind while devising our methods was that of providing diverse sets of recommendations: the experimentation that we conducted provides encouraging results in this sense.
Generating Stochastic Processes Based on the Finitary Interval Algorithm
Authors: Hiroshi Fujisaki
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We point out that the interval algorithm can be expressed in the form of a shift on the sequence space. Then we clarify that, by using a Bernoulli process, the interval algorithm can generate only a block of Markov chains or a sequence of independent blocks of Markov chains but not a stationary Markov process. By virtue of the finitary coding constructed by Hamachi and Keane, we obtain the procedure, called the finitary interval algorithm, to generate a Markov process by using the interval algorithm. The finitary interval algorithm also gives maps, defined almost everywhere, which transform a Markov measure to a Bernoulli measure.
Modelling climate change in a Dutch polder system using the FutureViewR modelling suite
Authors: W. W. Immerzeel, C. C. van Heerwaarden, P. Droogers
Venue: Computers Geosciences (2009)

This paper describes the development of a hydrological modelling suite, FutureViewR, which enables spatial quantification of the complex interaction between climate change, land use and soil in the Quarles van Ufford (QvU) polder entangled in and under influence of the Dutch river delta. The soil-water-atmosphere-plant (SWAP) model is used in a grid-based mode. A river module was developed to take into account seepage and percolation in the polder as an effect of the interaction with the main rivers. A simple surface water model was linked to the grid-based SWAP models. The model suite is managed from a Visual Basic (VB) interface which links the different modules. The interface uses a mainstream database management system (MS SQLServer), structured query language (SQL) and open database connectivity (ODBC) to store, transfer, manipulate and analyse model inputs and outputs. The functionality of the FutureViewR modeling suite is demonstrated by modeling a climate change scenario for 2050. The preliminary analysis showed that it is likely that the dryer summers in combination with low water levels in the Rhine and Meuse will yield a decrease in agricultural production. The wetter winters do not necessarily result in an increase in discharge, since the initial soil moisture storage at the winter onset is lower due to the dryer summers. It is concluded that the effects of climate change on polder hydrology is more intense caused by the dependence on local climate conditions and water levels on the Rhine and Meuse rivers, which are mutually reinforcing.
One Table Fits All
Authors: Jorge Costa, Ricardo Rocha
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Tabling is an implementation technique that overcomes some limitations of traditional Prolog systems in dealing with redundant sub-computations and recursion. The performance of tabled evaluation largely depends on the implementation of the table space. Arguably, the most successful data structure for tabling is tries. However, while tries are efficient for variant based tabled evaluation, they are limited in their ability to recognize and represent repeated answers for different calls. In this paper, we propose a new design for the table space where tabled subgoal calls and/or answers are stored only once in a common global trie instead of being spread over several different tries. Our preliminary experiments using the YapTab tabling system show very promising reductions on memory usage.
Wireless Internet Security: Architecture and Protocols, 1 edition
Authors: James Kempf
Venue:  (2008)

In describing tools for internet security, this title focuses on understanding the system architecture of existing security and on developing architectural changes for new security services. Topics include security threats in wireless networks, security services for countering those threats, and the process of defining functional architecture for network systems. Kempf also discusses examples of wireless Internet security systems such as wireless network access control, local IP subnet configuration and address resolution, and location privacy. Each chapter describes the basic network architecture and protocols for the system under consideration, security threats, functional architecture, and the important internet protocols that implement the architecture. This is an ideal resource for graduate students of electrical engineering and computer science, as well as for engineers and system architects in the wireless network industry.
In-Network Caching for Chip Multiprocessors
Authors: Aditya Yanamandra, Mary Jane Irwin, Vijaykrishnan Narayanan, Mahmut Kandemir, Sri Hari Narayanan
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Effective management of data is critical to the performance of emerging multi-core architectures. Our analysis of applications from SpecOMP reveal that a small fraction of shared addresses correspond to a large portion of accesses. Utilizing this observation, we propose a technique that augments a router in a on-chip network with a small data store to reduce the memory access latency of the shared data. In the proposed technique, shared data from read response packets that pass through the router are cached in its data store to reduce number of hops required to service future read requests. Our limit study reveals that such caching has the potential to reduce memory access latency on an average by 27%. Further, two practical caching strategies are shown to reduce memory access latency by 14% and 17% respectively with a data store of just four entries at 2.5% area overhead.
Compiling and Executing Declarative Modeling Languages to Gecode
Authors: Raffaele Cipriano, Agostino Dovier, Jacopo Mauro
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

We developed a compiler from SICStus Prolog CLP(FD) to Gecode and a compiler from MiniZinc to Gecode. We compared the running times of the executions of (standard) codes directly in the three languages and of the compiled codes for some classical problems. Performances of the compiled codes in Gecode improve those in the original languages and are comparable with running time of native Gecode code. This is a first step towards the definition of a unified declarative modeling tool for combinatorial problems.
Early and dynamic student achievement prediction in e-learning courses using neural networks
Authors: Ioanna Lykourentzou, Ioannis Giannoukos, George Mpardis, Vassilis Nikolopoulos, Vassili Loumos
Venue: Journal of the American Society for Information Science and Technology (2009)

The increasing popularity of e-learning has created a need for accurate student achievement prediction mechanisms, allowing instructors to improve the efficiency of their courses by addressing specific needs of their students at an early stage. In this paper, a student achievement prediction method applied to a 10-week introductory level e-learning course is presented. The proposed method uses multiple feed-forward neural networks to dynamically predict students' final achievement and to cluster them in two virtual groups, according to their performance. Multiple-choice test grades were used as the input data set of the networks. This form of test was preferred for its objectivity. Results showed that accurate prediction is possible at an early stage, more specifically at the third week of the 10-week course. In addition, when students were clustered, low misplacement rates demonstrated the adequacy of the approach. The results of the proposed method were compared against those of linear regression and the neural-network approach was found to be more effective in all prediction stages. The proposed methodology is expected to support instructors in providing better educational services as well as customized assistance according to students' predicted level of performance. &copy; 2009 Wiley Periodicals, Inc.
Automatic Extraction of Clause Relationships from a Treebank
Authors: Oldřich Krůza, Vladislav Kuboň
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

The paper concentrates on deriving non-obvious information about clause structure of complex sentences from the Prague Dependency Treebank. Individual clauses and their mutual relationship are not explicitly annotated in the treebank, therefore it was necessary to develop an automatic method transforming the original annotation concentrating on the syntactic role of individual word forms into a scheme describing the relationship between individual clauses. The task is complicated by a certain degree of inconsistency in original annotation with regard to clauses and their structure. The paper describes the method of deriving clause-related information from the existing annotation and its evaluation.
Fast calculation of pairwise mutual information for gene regulatory network reconstruction
Authors: Peng Qiu, Andrew J. Gentles, Sylvia K. Plevritis
Venue: Computer Methods and Programs in Biomedicine (2009)

We present a new software implementation to more efficiently compute the mutual information for all pairs of genes from gene expression microarrays. Computation of the mutual information is a necessary first step in various information theoretic approaches for reconstructing gene regulatory networks from microarray data. When the mutual information is estimated by kernel methods, computing the pairwise mutual information is quite time-consuming. Our implementation significantly reduces the computation time. For an example data set of 336 samples consisting of normal and malignant B-cells, with 9563 genes measured per sample, the current available software for ARACNE requires 142 hours to compute the mutual information for all gene pairs, whereas our algorithm requires 1.6 hours. The increased efficiency of our algorithm improves the feasibility of applying mutual information based approaches for reconstructing large regulatory networks.
Detecting Multiple Faults in One-Dimensional Arrays of Reversible QCA Gates
Authors: Xiaojun Ma, Jing Huang, Cecilia Metra, Fabrizio Lombardi
Venue: Journal of Electronic Testing: Theory and Applications (2009)

Reversible logic design is a well-known paradigm in digital computation. In this paper, quantum-dot cellular automata (QCA) is investigated for testable implementations of reversible logic in array systems. Testability of 1D arrays consisting of reversible QCA gates is investigated for multiple faulty modules. It has been shown that fault masking is possible in the presence of multiple faults without additional lines for controllability and observability. A technique for achieving C-testability of a 1D array is introduced by adding lines for observability. By adding lines for controllability, as well as observability, the array may be fully tested with a smaller number of test patterns. Different cases of arrays made of QCA reversible gates are presented to illustrate the applicability of the proposed testing method.
An integrated fuzzy-lp approach for a supplier selection problem in supply chain management
Authors: Ali Fuat Guneri, Atakan Yucel, Gokhan Ayyildiz
Venue: Expert Systems with Applications: An International Journal (2009)

In supply chain management process, the firm select best supplier takes the competitive advantage to other companies. Thus, supplier selection is an important issue and with the multiple criteria decision-making approach, the supplier selection problem includes both tangible and intangible factors. This paper is aimed to present an integrated fuzzy and linear programming approach to the problem. Firstly, linguistic values expressed in trapezoidal fuzzy numbers are applied to assess weights and ratings of supplier selection criteria. Then a hierarchy multiple model based on fuzzy set theory is expressed and fuzzy positive and negative ideal solutions are used to find each supplier's closeness coefficient. Finally, a linear programming model based on the coefficients of suppliers, buyer's budgeting, suppliers' quality and capacity constraints is developed and order quantities assigned to each supplier according to the linear programming model. The integrated model is illustrated by an example in a textile firm.
Integration of Power Management Units onto the SoC
Authors: Floriberto Lima
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

SoC complexity has increased exponentially adding new requirements to power management. To manage power dissipation and increase battery autonomy developers need to have flexible control over the supply of the multiple SoC power domains. Requirements include: supply voltages much lower than those available from the main supply; fine voltage programming, complex power sequencing; and very fast load response. All with high power conversion efficiency. External IC solutions make it difficult to comply with SoC performance and functional requirements, and result in a large BOM. Developers should consider flexible power management IP that can integrate onto their SoC or SiP to optimize performance, power efficiency, cost and size.
The impact of an innovative instructional intervention on the acquisition of oral presentation skills in higher education
Authors: Luc De Grez, Martin Valcke, Irene Roozen
Venue: Computers Education (2009)

The present study focuses on the design and development of an instructional approach to develop oral presentation skills. The theoretical base builds on the social cognitive perspective, and self-regulated learning. The aim of the study is to investigate whether the design of a multimedia-based instructional format - comprising of a standardised multimedia instruction, practical activities and feedback - will enhance oral presentation skills. In the study, the differential effect of three 'modes of feedback' on performance has been researched. The results reveal that oral presentation skills did improve significantly after the instruction. The multimedia nature of the design was favoured by all participants. In contrast, no significant impact of feedback was found. Nevertheless, feedback proved to be a useful process that was highly welcomed by participants.
Software reliability
Authors: Herbert Hecht
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The first session of the software reliability area will address Software Reliability Needs. It includes three invited papers that deal, respectively, with the origination of reliability requirements, with issues of reliability measurements, and with reliability modeling and prediction. All of them represent the cutting edge of the current technology and treat the subject in a broad manner that may be of interest also to the non-specialist; e.g., the discussion of reliability requirements is based on software used for a fly-by-wire system for transport aircraft. In this context, the overall aircraft safety regulations are examined, and the derivation of computer and software reliability requirements from these is outlined. All papers recognize that software reliability is an evolving discipline, one in which we are all students, and a field of tremendous importance for the future of computers in our society.
Network security and vulnerability
Authors: J. Michael Nye
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Technology-based society demands efficient and reliable communication networks. The introduction of microwave communication links has significantly increased the vulnerability of voice and data communications to electronic interception. With the wide acceptance of automated office systems and the increasing use of communicating word processors and distributed data terminals, proprietary, sensitive, and personal-privacy information can easily be intercepted through passive eavesdropping with relatively inexpensive equipment and limited technical resources. This session will provide an in-depth look at the problem and will review a variety of techniques for protecting facsimile, data, and voice communications.
An Execution Engine for Semantic Business Processes
Authors: Tammo Lessen, Jörg Nitzsche, Marin Dimitrov, Mihail Konstantinov, Dimka Karastoyanova, Luchesar Cekov, Frank Leymann
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

In this paper we present the architecture and design of an extended BPEL engine that implements the operational semantics of BPEL4SWS. BPEL4SWS is an extension of the BPEL language with support for Semantic Web Service concepts like mediation and semantic descriptions of activity implementations. We describe the basic communication scenarios of processes with services and the interaction between the engine components involved in the execution of BPEL4SWS processes. The presented prototype is based on the open source BPEL engine Apache ODE, features improved configurability and facilitates the definition of additional BPEL extensions with minimal development effort.
Regular production systems and triangle tilings
Authors: Chaim Goodman-Strauss
Venue: Theoretical Computer Science (2009)

We discuss regular production systems as a tool for analyzing tilings in general. As an application we give necessary and sufficient conditions for a generic triangle to admit a tiling of and show that almost every triangle that admits a tiling is "weakly aperiodic". We pause for informal discussion of a variety of other applications, such as non-quasi-isometric maps between regular tilings, non-periodic Archimedean tilings, growth, and decidability. Most generally, regular production systems provide a model for the organized growth of surfaces along a front, subject to local rules.
JASDL: A Practical Programming Approach Combining Agent and Semantic Web Technologies
Authors: Thomas Klapiscak, Rafael H. Bordini
Venue: Declarative Agent Languages and Technologies VI: 6th International Workshop, DALT 2008, Estoril, Portugal, May 12, 2008, Revised Selected and Invited Papers (2008)

Although various ideas for integrating Semantic Web and Agent Programming techniques have appeared in the literature, as yet no practical programming approach has managed to harness the full potential for declarative agent-oriented programming of currently widely used Semantic Web technologies. When agent programmers are familiar with existing ontologies for the domain of interest, they can take advantage of the knowledge already represented there to make their programs much more compact and elegant, besides the obvious interoperability and reuse advantages. This paper describes JASDL: an extension of the Jason agent platform which makes use of OWL-API to provide features such as plan trigger generalisation based on ontological knowledge and the use of such knowledge in querying the belief base. The paper also includes a running example which clearly illustrates the features and advantages of our approach.
Functional data analysis for non homogeneous Poisson processes
Authors: Martín Gastón, Teresa León, Fermín Mallor
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper we intend to illustrate how Functional Data Analysis (FDA) can be very useful for simulation input modelling. In particular, we are interested in the estimation of the cumulative mean function of a non-homogeneous Poisson Process (NHPP). Both parametric and nonparametric methods have been developed to estimate it from observed independent streams of arrival times. As far as we know, these data have not been analyzed as functional data. The basic idea underlying of FDA is treating a functional observation as a single datum rather than as a large set of data on its own. A considerable effort is being made in order to adapt some standard statistical methods for functional data, for instance Principal Components Analysis, ANOVA, classification techniques, bootstrap confidence bands, or outlier detection. We have studied a set of real data making use of these techniques and obtaining very good results.
Welcome to "The Functional Web"
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2009)

For many years, the mainstream software development community has mostly viewed functional programming languages as academic curiosities. Thankfully, this is now changing, as more developers embrace functional languages with the hope of gaining from the higher levels of abstraction, source code brevity, and other benefits these languages offer. This is the first installment of Steve Vinoski's new column, "The Functional Web," which focuses on using functional languages for RESTful Web service application development.
Physical unclonable function and true random number generator: a compact and scalable implementation
Authors: Abhranil Maiti, Raghunandan Nagesh, Anand Reddy, Patrick Schaumont
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Physical Unclonable Functions (PUF) and True Random Number Generators (TRNG) are two very useful components in secure system design. PUFs can be used to extract chip-unique signatures and volatile secret keys, whereas TRNGs are used for generating random padding bits, initialization vectors and nonces in cryptographic protocols. This paper proposes a scalable design technique to implement both a delay-based PUF and a jitter-based TRNG using ring oscillators. By sharing and reusing a significant amount of hardware resources, we achieve nearly 50% area reduction as compared to discrete implementations. We also propose and demonstrate a co-processor-based design that renders the circuit portable across various embedded processor platforms on FPGAs. Multiple scaled designs using 32 to 128 ring oscillators have been implemented and verified on Xilinx Spartan3S500E FPGA. A representative design uses 32 3-inverter ring oscillators, 64 flip-flops/latches, 31 2-input XOR gates and control circuitry giving a 3.2Mbps truly random stream and 31-bit unique device signature.