ppxscal/embedding_network huggingface dataset:
CoLeP: An Agent-Based Collaborative System for Pervasive Learning
Authors: Wei-Lun Chang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Collaborative learning is one of the intense topics from electronic learning (e-learning) to pervasive learning (p-learning) based on the diverse technology. This study attempts to shift the paradigm from e-learning to p-learning by combining pervasive computing technology. We consider students around the campus need to learn anytime anywhere except formal learning in the classroom. Consequently, this paper proposes an informal learning system called CoLeP to support pervasive learning. CoLeP system overcomes the existing learning problems such as learning in the fixed locations, teaching students accordingly with their aptitude, and interacting with limited devices. Finally, this work identifies three major contributions: (1) sharing knowledge immediately, (2) discussing collaboratively, and (3) learning anytime and anywhere.
Verifying dereference safety via expanding-scope analysis
Authors: Alexey Loginov, Eran Yahav, Satish Chandra, Stephen Fink, Noam Rinetzky, Mangala Nanda
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

This paper addresses the challenging problem of verifying the safety of pointer dereferences in real Java programs. We provide an automatic approach to this problem based on a sound interprocedural analysis. We present a staged expanding-scope algorithm for interprocedural abstract interpretation, which invokes sound analysis with partial programs of increasing scope. This algorithm achieves many benefits typical of whole-program interprocedural analysis, but scales to large programs by limiting analysis to small program fragments. To address cases where the static analysis of program fragments fails to prove safety, the analysis also suggests possible annotations which, if a user accepts, ensure the desired properties. Experimental evaluation on a number of Java programs shows that we are able to verify 90% of all dereferences soundly and automatically, and further reduce the number of remaining dereferences using non-nullness annotations.
Exploration scavenging
Authors: John Langford, Alexander Strehl, Jennifer Wortman
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We examine the problem of evaluating a policy in the contextual bandit setting using only observations collected during the execution of another policy. We show that policy evaluation can be impossible if the exploration policy chooses actions based on the side information provided at each time step. We then propose and prove the correctness of a principled method for policy evaluation which works when this is not the case, even when the exploration policy is deterministic, as long as each action is explored sufficiently often. We apply this general technique to the problem of offline evaluation of internet advertising policies. Although our theoretical results hold only when the exploration policy chooses ads independent of side information, an assumption that is typically violated by commercial systems, we show how clever uses of the theory provide non-trivial and realistic applications. We also provide an empirical demonstration of the effectiveness of our techniques on real ad placement data.
A Location-Aware System Using RFID and Mobile Devices for Art Museums
Authors: R. Tesoriero, J. A. Gallud, M. Lozano, V. M. R. Penichet
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

Emerging location-aware mobile technologies are being applied successfully in cultural environments. Different technologies, such as RFID, WiFi, and so on, are being applied to allow mobile devices interact with the environment. This paper describes a system based on both active and passive RFID which support the automatic positioning of mobile devices in art museums. This proposal results especially useful to provide location-aware information avoiding the need for users to manually select the desired information they want to see. This proposal has been successfully proved for the location and positioning of PDAs.
PMOS-only sleep switch dual-threshold voltage domino logic in sub-65-nm CMOS technologies
Authors: Zhiyu Liu, Volkan Kursun
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A circuit technique is proposed in this paper for simultaneously reducing the subthreshold and gate oxide leakage power consumption in domino logic circuits. Only p-channel sleep transistors and a dual-threshold voltage CMOS technology are utilized to place an idle domino logic circuit into a low leakage state. Sleep transistors are added to the dynamic nodes in order to reduce the subthreshold leakage current by strongly turning off all of the high-threshold voltage transistors. Similarly, the sleep switches added to the output nodes suppress the voltages across the gate insulating layers of the transistors in the fan-out gates, thereby minimizing the gate tunneling current. The proposed circuit technique lowers the total leakage power by up to 77% and 97% as compared to the standard dual-threshold voltage domino logic circuits at the high and low die temperatures, respectively. Similarly, a 22% to 44% reduction in the total leakage power is observed as compared to a previously published sleep switch scheme in a 45-nm CMOS technology. The energy overhead of the circuit technique is low, justifying the activation of the proposed sleep scheme by providing a net savings in total energy consumption during short idle periods.
Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007
Venue: ACM International Conference Proceeding Series; Vol. 286 (2007)

Although Smalltalk is one of the oldest object-oriented programming languages, its conception and programming environment can still be considered as a design pearl and as a beacon in the realm of programming languages and programming environments. Other dynamic languages (such as Lisp, Scheme, Self,...) were similarly influential in expanding what software engineers can express with their programs.With the rising popularity of languages like Ruby, Python, Javascript, PHP, and with the growing challenges of aspect-orientation, pervasive computing, mobile code, and context-aware computing, dynamic languages are a worthy topic for further research. Therefore, ESUG decided to broaden the scope of the formerly "Smalltalk only" research track of its yearly meeting in order to enable cross-fertilization with research conducted using other dynamic languages. This way we hope to obtain more significant scientific results on various aspects of dynamicity in programming languages. This volume holds the papers that were presented during the 2007 edition of the conference which was held in Lugano, Switzerland. After careful reviewing by at least three reviewers we selected 11 papers out of 16 for inclusion in the conference. We took great care to avoid conflicts of interest by ensuring that reviewers did not have any formal connections to one of the authors of the papers they reviewed, namely (a) working in the same institution, university, or research group, (b) having written joint papers, (c) supervised earlier work, (d) had family ties, (e) or otherwise felt uncomfortable reviewing the work. The papers were reviewed using the typical academic standards: (a) present sound scientific work (a relevant problem, a convincing solution described in sufficient detail to allow replication, a sound validation, cite related work), (b) help the community (have something interesting to say to researchers working on dynamic programming languages in general and Smalltalk in particular), (c) reports something worthwhile for further reference (other researchers will cite this work in the future).
Extracting hidden anomalies using sketch and non Gaussian multiresolution statistical detection procedures
Authors: Guillaume Dewaele, Kensuke Fukuda, Pierre Borgnat, Patrice Abry, Kenjiro Cho
Venue: Proceedings of the 2007 workshop on Large scale attack defense (2007)

A new profile-based anomaly detection and characterization procedure is proposed. It aims at performing prompt and accurate detection of both short-lived and long-lasting low-intensity anomalies, without the recourse of any prior knowledge of the targetted traffic. Key features of the algorithm lie in the joint use of random projection techniques (sketches) and of a multiresolution non Gaussian marginal distribution modeling. The former enables both a reduction in the dimensionality of the data and the measurement of the reference (i.e., normal) traffic behavior, while the latter extracts anomalies at different aggregation levels. This procedure is used to blindly analyze a large-scale packet trace database collected on a trans-Pacific transit link from 2001 to 2006. It can detect and identify a large number of known and unknown anomalies and attacks, whose intensities are low (down to below one percent). Using sketches also makes possible a real-time identification of the source or destination IP addresses associated to the detected anomaly and hence their mitigation.
Setup Planning and Operation Sequencing Using Neural Network and Genetic Algorithm
Authors: Ravinder Singh Joshi, Navdeep Kumar, Anju Sharma
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In process planning setup planning and operation sequencing are the major issues. In setup planning feature having same approach direction & tool commonality are grouped into setup. After making different setups operation sequencing in each setup is done for setup planning neural network is efficient. Operation sequencing problem is converted into the traveling salesman problem in which objective function is to reduce total cost. To solve these issues in an efficient manner Genetic Algorithm technique is more suitable because it is a viable means for searching the solution space of operation sequence providing a computational time on the order of a few seconds. The present work generates the results for the prismatic parts. The presented algorithm for setup planning and operation sequencing is efficient enough for its use as a module within the development of a CAPP system.
Replication-Based Incremental Compaction
Authors: Tomoharu Ugawa, Masahiro Yasugi, Taiichi Yuasa
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

We propose an incremental compaction algorithm. Our compactor selects a continuous area of the heap and evacuates it by incrementally copying all objects in the area to the rest of the heap. After all objects have been copied, our compactor incrementally updates pointers pointing into the evacuated area. During these processes, each original object and its copy are kept consistent. We implemented the compactor together with a snapshot garbage collector in the KVM. Our measurements show that (1) the largest free chunk is almost always more than 20\% as large asthe entire heap when the heap is twice as large as the maximum amount of live objects, (2) the runtime overhead is less than 20\%, and (3) the maximum pause time caused by the compactor is comparable to that caused by the snapshot collector.
An accurate Fourier-spectral solver for variable coefficient elliptic equations
Authors: Moshe Israeli, Alexander Sherman
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

We develop a solver for nonseparable, self adjoint elliptic equations with a variable coefficient. If the coefficient is the square of a harmonic function, a transformation of the dependent variable, results in a constant coefficient Poisson equation. A highly accurate, fast, Fourier-spectral algorithm can solve this equation. When the square root of the coefficient is not harmonic, we approximate it by a harmonic function. A small number of correction steps are then required to achieve high accuracy. The procedure is particularly efficient when the approximation error is small. For a given function this error becomes smaller as the size of the domain decreases. A highly parallelizable, hierarchical procedure allows a decomposition into small sub-domains. Numerical experiments illustrate the accuracy of the approach even at very coarse resolutions.
Consistency measure, inclusion degree and fuzzy measure in decision tables
Authors: Yuhua Qian, Jiye Liang, Chuangyin Dang
Venue: Fuzzy Sets and Systems (2008)

Classical consistency degree has some limitations for measuring the consistency of a decision table, in which the lower approximation of a target decision is only taken into consideration. In this paper, we focus on how to measure the consistencies of a target concept and a decision table and the fuzziness of a rough set and a rough decision in rough set theory. For three types of decision tables (complete, incomplete and maximal consistent blocks), the membership functions of an object are defined through using the equivalence class, tolerance class and maximal consistent blocks including itself, respectively. Based on these membership functions, we introduce consistency measures to assess the consistencies of a target set and a decision table, and define fuzziness measures to compute the fuzziness of a rough set and a rough decision in these three types of decision tables. In addition, the relationships among the consistency, inclusion degree and fuzzy measure are established as well. These results will be helpful for understanding the essence of the uncertainty in decision tables and can be applied for rule extraction and rough classification in practical decision issues.
Stable maintenance of point set triangulations in two dimensions
Authors: S. Fortune
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Geometric algorithms are explored, assuming that arithmetic is done approximately. Stable algorithms are described for two geometric problems. The first algorithm computes two-dimensional convex hulls. The main result is that a triangulation of a set of points in the plane can be maintained stably. The second algorithm deals with line arrangements in the plane.
Linking Semantic and Knowledge Representations in a Multi-Domain Dialogue System
Authors: Myroslava O. Dzikovska, James F. Allen, Mary D. Swift
Venue: Journal of Logic and Computation (2008)

We describe a two-layer architecture for supporting semantic interpretation and domain reasoning in dialogue systems. Building system that supports both semantic interpretation and domain reasoning in a transparent and well-integrated manner is an unresolved problem because of the diverging requirements of the semantic representations used in contextual interpretation versus the knowledge representations used in domain reasoning. We propose an architecture that provides both portability and efficiency in natural language interpretation by maintaining separate semantic and domain knowledge representations, and integrating them via an ontology mapping procedure. The ontology mapping is used to obtain representations of utterances in a form most suitable for domain reasoners and to automatically specialize the lexicon. The use of a linguistically motivated parser for producing semantic representations for complex natural language sentences facilitates building portable semantic interpretation components as well as connections with domain reasoners. Two evaluations demonstrate the effectiveness of our approach: we show that a small number of mapping rules are sufficient for customizing the generic semantic representation to a new domain, and that our automatic lexicon specialization technique improves parser speed and accuracy.
Visual analytics of spatial interaction patterns for pandemic decision support
Authors: D. Guo
Venue: International Journal of Geographical Information Science (2007)

Population mobility, i.e. the movement and contact of individuals across geographic space, is one of the essential factors that determine the course of a pandemic disease spread. This research views both individual-based daily activities and a pandemic spread as spatial interaction problems, where locations interact with each other via the visitors that they share or the virus that is transmitted from one place to another. The research proposes a general visual analytic approach to synthesize very large spatial interaction data and discover interesting (and unknown) patterns. The proposed approach involves a suite of visual and computational techniques, including (1) a new graph partitioning method to segment a very large interaction graph into a moderate number of spatially contiguous subgraphs (regions); (2) a reorderable matrix, with regions 'optimally' ordered on the diagonal, to effectively present a holistic view of major spatial interaction patterns; and (3) a modified flow map, interactively linked to the reorderable matrix, to enable pattern interpretation in a geographical context. The implemented system is able to visualize both people's daily movements and a disease spread over space in a similar way. The discovered spatial interaction patterns provide valuable insight for designing effective pandemic mitigation strategies and supporting decision-making in time-critical situations.
Very Fast Multi Operand Addition Method by Bitwise Subtraction
Authors: Kooroush Manochehri, Saadat Pourmozafari, Babak Sadeghian
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Basic operations of public key cryptography are multiplication and exponentiation. Because of long operand length, their processing is very time consuming operations. The basic of all of these operations is multi operand addition. To improve this operation’s performance, many methods are used, that Carry Save Adder (CSA) is the best method until now. This Paper proposed a new method with the same performance as CSA but with 40% less logic gates than CSA. This area reduction may lead to less power consumption and sometimes more processing speed, that are suitable for embedded processor. The idea of proposed method is bitwise subtraction that there is no carry propagation needed that is very useful for long length multi additions.
Anti-Bacterial Property of Cold Sprayed ZnO-Al Coating
Authors: Noppakun Sanpo, Saraswati, Tan Meng Lu, Philip Cheang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The antibacterial behaviour of ZnO nanopowder and their composite coatings were investigated against E. Coli. ZnO nanopowder and Aluminum based ZnO composite powders were synthesized using in-house powder processing techniques. Bacteria culture results showed that ZnO nanopowder and their composite powders displayed excellent bacteriostatic activity against E. coli. The antibacterial activity increased with increasing concentration of ZnO nanoparticle in their composite powders as well as increasing surface area of compacted pellets. These nanocomposite powders were subsequently used to generate antibacterial coatings using cold spray technology. The ratio of Al to ZnO in their composite powders were 80:20, 50:50 and 20:80 (wt.%). Microstructural characterization and phase analysis of feedstock powders and as-deposited coatings were carried out using FESEM/EDX and XRD. Antibacterial nanocomposite Al-ZnO coatings were successfully deposited using cold spraying parameters of 15 Bars at air temperature of between 200-300 oC. These as-sprayed coatings of Al-ZnO composite powders with varying Al and ZnO ratios retained their inherent antibacterial property as verified from bacterial counting test. The results indicated that the antibacterial activity increased with increasing ZnO nanopowder concentration in the composite powder feedstock and cold sprayed coating.
Role of grid computing in Indian education
Authors: Ditu Soni, Jyotsna Sharma
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

A grid is a collection of distributed computing resources available over a local or wide area network that appear to an end user or application as one large virtual computing system. Grid computing has serious social consequences and is going revolutionize the world of computing. Education is one domain that can be benefited the most from grid computing. The focus on leveraging technologies and products from academic institutions around the world in the areas of e-learning, front-end portals, library automation and digital asset management to promote the sharing and collaboration in the use of technologies, developing content, defining standards and building best-of-breed pedagogical practices is the new upcoming trend. With a lot of work going on in this emerging domain, internationally, India too has joined the bandwagon to contribute to the development in this discipline. This paper aims to present the state-of-the-art of grid computing and attempts to survey India's efforts in developing this upcoming technology. By allowing anyone, anywhere, anytime to easily access supercomputer level processing power and knowledge resources, grids are underpining progress in Indian Education.
EPO-KB
Authors: Jonathan L. Lustgarten, Chad Kimmel, Henrik Ryberg, William Hogan
Venue: Bioinformatics (2008)

Summary: The knowledge base EPO-KB (Empirical Proteomic Ontology Knowledge Base) is based on an OWL ontology that represents current knowledge linking mass-to-charge (m/z) ratios to proteins on multiple platforms including Matrix Assisted Laser/Desorption Ionization (MALDI) and Surface Enhanced Laser/Desorption Ionization (SELDI) – Time of Flight (TOF). At present, it contains information on m/z ratio to protein links that were extracted from 120 published research papers. It has a web interface that allows researchers to query and retrieve putative proteins that correspond to a user-specified m/z ratio. EPO-KB also allows automated entry of additional m/z ratio to protein links and is expandable to the addition of gene to protein and protein to disease links. Availability: http://www.dbmi.pitt.edu/EPO-KB Contact: JLL47@pitt.edu
A distributed CSP approach for collaborative planning systems
Authors: Oscar Sapena, Eva Onaindia, Antonio Garrido, Marlene Arangu
Venue: Engineering Applications of Artificial Intelligence (2008)

Distributed or multi-agent planning extends classical AI planning to domains where several agents can plan and act together. There exist many recent developments in this discipline that range over different approaches for distributed planning algorithms, distributed plan execution processes or communication protocols among agents. One of the key issues about distributed planning is that it is the most appropriate way to tackle certain kind of planning problems, specially those where a centralized solving is unfeasible. In this paper we present a new planning framework aimed at solving planning problems in inherently distributed domains where agents have a collection of private data which cannot share with other agents. However, collaboration is required since agents are unable to accomplish its own tasks alone or, at least, can accomplish its tasks better when working with others. Our proposal motivates a new planning scheme based on a distributed heuristic search and a constraint programming resolution process.