ppxscal/embedding_network huggingface dataset:
Fast methods to compute the riemann zeta function
Authors: Andrew Odlyzko
Venue:  (2008)

The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Sch&ouml;nhage's method, or Heath-Brown's method. The complexities of these methods have exponents 1/2, 3/8 (=0.375), and 1/3 respectively. In this thesis, three new fast and potentially practical methods to compute zeta are presented. One method is very simple. Its complexity has exponent 2/5. A second method relies on this author's algorithm to compute quadratic exponential sums. Its complexity has exponent 1/3. The third method employs an algorithm, developed in this thesis, to compute cubic exponential sums. Its complexity has exponent 4/13 (approximately, 0.307).
When does the giant component bring unsatisfiability?
Authors: Michael Molloy
Venue: Combinatorica (2008)

We study random constraint satisfaction problems using the wide class of models introduced by the author [36], which includes various forms of random SAT and other well-studied problems. We determine precisely which of these models remain almost surely satisfiable when the number of clauses is increased beyond the point at which a giant component appears in the underlying constraint hypergraph.
XML with incomplete information: models, properties, and query answering
Authors: Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

We study models of incomplete information for XML, their computational properties, and query answering. While our approach is motivated by the study of relational incompleteness, incomplete information in XML documents may appear not only as null values but also as missing structural information. Our goal is to provide a classification of incomplete descriptions of XML documents, and separate features - or groups of features - that lead to hard computational problems from those that admit efficient algorithms. Our classification of incomplete information is based on the combination of null values with partial structural descriptions of documents. The key computational problems we consider are consistency of partial descriptions, representability of complete documents by incomplete ones, and query answering. We show how factors such as schema information, the presence of node ids, and missing structural information affect the complexity of these main computational problems, and find robust classes of incomplete XML descriptions that permit tractable query evaluation.
A Web Service-Oriented Architecture for Implementing Web Information Systems
Authors: Flavius Frasincar, Geert-Jan Houben, Peter Barna
Venue: Proceeding of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006 (2007)

Web services are one of the most popular ways for building distributed Web Information Systems (WIS). In this paper we propose a distributed implementation of the Hera methodology, a methodology based on models that specify the different aspects of a WIS. The Web services used in the implementation are responsible for capturing the required data transformations built around specific Hera models. A service orchestrator coordinates the different Web services so that the required WIS presentation is built. Based on the degree of support of the user interaction with the system two architectures are identified: one for the construction of static applications, and another one for the building of dynamic applications.
A semantic middleware for autonomic wireless sensor networks
Authors: Atslands R. da Rocha, Flávia C. Delicato, José Neuman de Souza, Danielo G. Gomes, Luci Pirmez
Venue: Proceedings of the 2009 Workshop on Middleware for Ubiquitous and Pervasive Systems (2009)

In this paper we present a proposal that combines the benefits of autonomic and semantic sensor networks to build a semantic middleware for autonomic wireless sensor networks. The key feature of the proposed middleware is a rule-based reasoning engine based on ontology and fuzzy logic. We also propose a semantic-aware topology control based on computing semantic neighborhoods relationships. The middleware was tailored to provide support for Structural Health Monitoring applications. However, it has a flexible architecture and it can be extensible to several other application domains such as ambient intelligence, habitat monitoring and fire detection. We use the oil platform structural health monitoring domain as a case study. The paper presents the middleware architecture and the proposed ontologies.
Tangible optical chess: a laser strategy game on an interactive tabletop
Authors: David Joyner, Chih-Sung (Andy) Wu, Chih-Sung (Andy) Wu, Ellen Yi-Luen Do, Ellen Yi-Luen Do
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

This paper presents Tangible Tracking Table, an interactive tabletop display, and Optical Chess, a strategy game. We discuss the design and implementation of both systems and report our evaluation game play sessions with young adults, with a special focus on how the Tangible Tracking Table enhances interaction over a point-and-click interface.
Development of Clemson variable-rate lateral irrigation system
Authors: Young J. Han, Ahmad Khalilian, Tom O. Owino, Hamid J. Farahani, Sam Moore
Venue: Computers and Electronics in Agriculture (2009)

Crops in the Southern United States are generally produced in fields which are known to have a high degree of variability in soil type, water holding capacity, infiltration rates, and other major factors which affect crop production. In these fields, the ability to turn irrigation water on or off or apply variably to different segments of the field is advantageous over the conventional uniform application. A variable-rate lateral irrigation (VRLI) system was developed for site-specific application of water to match field variability. The system consists of solid-state relays controlled by custom software, air-actuated diaphragm valves, a forward speed control system and a GPS receiver. The Clemson VRLI system applies variable-rate water utilizing the nozzle-pulsing technique and variable speed control system. This system could monitor and apply water based on the actual soil moisture content, pan evaporation data, or the U.S. Climate Reference Network (CRN) data. Uniformity tests show that the system is able to control the irrigation rate from 0 to 2.5cm of irrigation water and can control the forward speed between 145 and 29m/h. The pulsing technique to deliver variable amounts of irrigation had little adverse effect on system uniformity and nozzle flow rate with an average application error of less than 2%.
Processing and mechanical properties of a new flexible acrylic stereolithographic resin family for engineering and medical device manufacturing
Authors: Carsten Tille, Arthur T. Bens, Hermann Seitz
Venue: International Journal of Computer Applications in Technology (2009)

Stereolithography, as a well-known rapid prototyping process, has been used in a wide field of technical and also medical applications. Due to the stereolithography principle &ndash; the curing of a liquid photopolymer by a UV laser &ndash; the number of commercially available reaction mechanisms and related material characteristics is very limited. Our paper presents a novel class of non-toxic, biocompatible polyether(meth)acrylate-based resin formulations with outstanding flexible material characteristics. In contrast to the mostly rigid commercial engineering materials, these polymeric formulations are able to meet the demands for soft to stiff parts. Depending on the individual formulation, the cured resins can show a Young's modulus from 25 MPa up to 1500 MPa. We give an overview over basic formulations and processing characteristics for this material class. Process parameters were studied in a commercial Viper Si&#178; system (3D Systems); mechanical properties of different formulations were tested using standard tensile testing methods.
Last Conflict based Reasoning
Authors: Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priority, as long as the constraint network can not be made consistent, in order to find the (most recent) culprit variable, following the current partial instantiation from the leaf to the root of the search tree. In other words, the variable ordering heuristic is violated, until a backtrack to the culprit variable occurs and a singleton consistent value is found. Consequently, this way of reasoning can easily be grafted to many search algorithms and represents an original way to avoid thrashing. Experiments over a wide range of benchmarks demonstrate the effectiveness of this approach.
Reusing task-specific knowledge-based systems to generate intelligent tutoring systems
Authors: Eman M. El-Sheikh, Jon Sticklen
Venue: International Journal of Advanced Intelligence Paradigms (2009)

This work advances the knowledge-based systems paradigm to address the need for reusable Intelligent Tutoring Systems (ITSs), and more cost-effective ITS development methods. We describe a novel approach and architecture that can interact with task-specific knowledge-based systems to automatically generate ITSs for the domains represented by those systems. Our approach facilitates the reuse of both intelligent tutoring components, and problem solving and domain knowledge embedded within knowledge-based systems for tutoring. We describe the development of the architecture, report two case studies on using the architecture to generate ITSs for two very different domains, and present and evaluate our results.
Bio-optical properties and estimation of the optically active substances in Lake Tianmuhu in summer
Authors: Yun L. Zhang, Ming L. Liu, Xin Wang, Guang W. Zhu, Wei M. Chen
Venue: International Journal of Remote Sensing (2009)

Bio-optical properties in an optically complex and biologically productive region of Lake Tianmuhu were determined in three cruises from June to August 2006. The concentrations of three optically active substances, tripton C Tripton (calculated from total suspended matter and chlorophyll-a (Chla) and phaeophytin-a (Pa)), phytoplankton pigment C Chla+Pa, and chromophoric dissolved organic matter (CDOM) a CDOM(440), were predicted from the estimated irradiance reflectance based on in situ measurements and laboratory analyses. The total relative contributions of phytoplankton, tripton, CDOM and pure water over the range of photosynthetically active radiation (PAR) (400-700 nm) were 36.1%, 24.2%, 15.9% and 23.8%, respectively. The dominant contribution of phytoplankton to the total absorption was due to high phytoplankton pigment concentration. The range and variation in irradiance reflectance and diffuse attenuation coefficient derived from a bio-optical model, based on inherent optical properties, compared well with the measured variability. A reasonably strong relationship (R2 = 0.92) was observed between irradiance reflectance at 780 nm R(780) and C Tripton. For our data set, the best algorithm for C Chla+Pa used the three-band reflectance model [R -1(688)-R -1(717)]×R(747). The a CDOM(440) could be estimated using the ratio of irradiance reflectance R(682)/R(555). The retrieval accuracy (R2) of tripton, phytoplankton pigment and CDOM was 0.92, 0.87 and 0.91, respectively, while the rms. error was 0.90 mg l-1 (18.2%), 3.27 µg l-1 (14.8%) and 0.073 m-1 (15.3%), respectively. Estimation of the concentrations of the three optically active substances was reasonably accurate based on inherent optical properties measurement.
Meta-heuristics for reconstructing cross cut shredded text documents
Authors: Matthias Prandtstetter, Günther R. Raidl
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documents. For quickly obtaining initial solutions, we consider four different construction heuristics. While one of them is based on the well known algorithm of Prim, another one tries to match shreds according to the similarity of their borders. Two further construction heuristics rely on the fact that in most cases the left and right edges of paper documents are blank, i.e. no text is written on them. Randomized variants of these construction heuristics are applied within the ACO. Experimental tests reveal that regarding the solution quality the proposed ACO variants perform better than the VNS approaches in most cases, while the running times needed are shorter for VNS. The high potential of these approaches for reconstructing cross cut shredded text documents is underlined by the obtained results.
Detection and Grammaticality Judgment of Forms in a Language Education System Oriented for Focus on Form
Authors: Makoto Kondo, Takafumi Shiratori, Naoki Minai, Satoru Kogure, Tatsuhiro Konishi, Yukihiro Itoh
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper describes how to develop a language education system oriented for a pedagogical approach called focus on form (FonF). FonF aims at improving skills to produce grammatically correct sentences. The approach has attracted much attention in the field of second language education because it could overcome a potential problem of another pervasively adopted approach called communicative approach (CA). The CA puts the highest priority on cultivating communicative fluency and grammatical correctness is considered less important than conveying intention. As a result, there is a risk that learners would miss a chance to correct their misunderstanding of grammatical rules in target languages. If FonF instruction is effectively incorporated into a language education system oriented for the CA, it should overcome the problem by giving appropriate grammatical instruction while learners are engaging in conversation practice based on the CA. In this study, we selected 145 linguistic forms to teach based on the FonF approach and implemented functions necessary for FonF instruction: a function to detect the linguistic forms in input sentences, and a function to judge whether detected forms are used correctly from the viewpoints of morphosyntactic correctness and semantic correctness.
Address standardization with latent semantic association
Authors: Honglei Guo, Huijia Zhu, Zhili Guo, XiaoXun Zhang, Zhong Su
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Address standardization is a very challenging task in data cleansing. To provide better customer relationship management and business intelligence for customer-oriented cooperates, millions of free-text addresses need to be converted to a standard format for data integration, de-duplication and householding. Existing commercial tools usually employ lots of hand-craft, domain-specific rules and reference data dictionary of cities, states etc. These rules work better for the region they are designed. However, rule-based methods usually require more human efforts to rewrite these rules for each new domain since address data are very irregular and varied with countries and regions. Supervised learning methods usually are more adaptable than rule-based approaches. However, supervised methods need large-scale labeled training data. It is a labor-intensive and time-consuming task to build a large-scale annotated corpus for each target domain. For minimizing human efforts and the size of labeled training data set, we present a free-text address standardization method with latent semantic association (LaSA). LaSA model is constructed to capture latent semantic association among words from the unlabeled corpus. The original term space of the target domain is projected to a concept space using LaSA model at first, then the address standardization model is active learned from LaSA features and informative samples. The proposed method effectively captures the data distribution of the domain. Experimental results on large-scale English and Chinese corpus show that the proposed method significantly enhances the performance of standardization with less efforts and training data.
Adapting Information and Communication Technologies for Effective Education
Authors: Lawrence Tomei, Lawrence Tomei
Venue:  (2007)

Educational initiatives attempt to introduce or promote a culture of quality within education by raising concerns related to student learning, providing services related to assessment, professional development of teachers, curriculum and pedagogy, and influencing educational policy, in the realm of technology. Adapting Information and Communication Technologies for Effective Education addresses ICT assessment in universities, student satisfaction in management information system programs, factors that impact the successful implementation of a laptop program, student learning and electronic portfolios, and strategic planning for e-learning. Providing innovative research on several fundamental technology-based initiatives, this book will make a valuable addition to every reference library.
A Gentle Introduction to System Verification
Authors: Love Ekenberg
Venue: Proceeding of the 2005 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fourth SoMeT_W05 (2005)

Verification is an important instrument in the analysis of systems. Roughly, this means that requirements and designs are analyzed formally to determine their relationships. Various candidates for formalizing system development and integration have been proposed. However, a major obstacle is that these introduce non-standard objects and formalisms, leading to severe confusion. This is because these models often are unnecessarily complicated with several disadvantages regarding semantics as well as complexity. While avoiding the mathematical details as far as possible, we present some basic verification ideas using a simple language such as predicate logic and demonstrate how this can be used for defining and analyzing static and dynamic requirement fulfillment by designs as well as for detecting conflicts. The formalities can be found in the appendix.
MODIST: transparent model checking of unmodified distributed systems
Authors: Junfeng Yang, Tisheng Chen, Ming Wu, Zhilei Xu, Xuezheng Liu, Haoxiang Lin, Mao Yang, Fan Long, Lintao Zhang, Lidong Zhou
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

MODIST is the first model checker designed for transparently checking unmodified distributed systems running on unmodified operating systems. It achieves this transparency via a novel architecture: a thin interposition layer exposes all actions in a distributed system and a centralized, OS-independent model checking engine explores these actions systematically. We made MODIST practical through three techniques: an execution engine to simulate consistent, deterministic executions and failures; a virtual clock mechanism to avoid false positives and false negatives; and a state exploration framework to incorporate heuristics for efficient error detection. We implemented MODIST on Windows and applied it to three well-tested distributed systems: Berkeley DB, a widely used open source database; MPS, a deployed Paxos implementation; and PACIFICA, a primary-backup replication protocol implementation. MODIST found 35 bugs in total. Most importantly, it found protocol-level bugs (i.e., flaws in the core distributed protocols) in every system checked: 10 in total, including 2 in Berkeley DB, 2 in MPS, and 6 in PACIFICA.
Hop-to-Hop Reliability in IP-Based Wireless Sensor Networks - A Cross-Layer Approach
Authors: Gerald Wagenknecht, Markus Anwander, Torsten Braun
Venue: Proceedings of the 7th International Conference on Wired/Wireless Internet Communications (2009)

To interconnect a wireless sensor network (WSN) to the Internet, we propose to use TCP/IP as the standard protocol for all network entities. We present a cross layer designed communication architecture, which contains a MAC protocol, IP, a new protocol called Hop-to-Hop Reliability (H2HR) protocol, and the TCP Support for Sensor Nodes (TSS) protocol. The MAC protocol implements the MAC layer of beacon-less personal area networks (PANs) as defined in IEEE 802.15.4. H2HR implements hop-to-hop reliability mechanisms. Two acknowledgment mechanisms, explicit and implicit ACK are supported. TSS optimizes using TCP in WSNs by implementing local retransmission of TCP data packets, local TCP ACK regeneration, aggressive TCP ACK recovery, congestion and flow control algorithms. We show that H2HR increases the performance of UDP, TCP, and RMST in WSNs significantly. The throughput is increased and the packet loss ratio is decreased. As a result, WSNs can be operated and managed using TCP/IP.
Recovering Reasoning Processes from User Interactions
Authors: Wenwen Dou, Dong Hyun Jeong, Felesia Stukes, William Ribarsky, Heather Richter Lipford, Remco Chang
Venue: IEEE Computer Graphics and Applications (2009)

Understanding how analysts use visual-analytics (VA) tools can help reveal their reasoning processes when using these tools. By examining analysts' interaction logs, the authors identified the analysts' strategies, methods, and findings when using a financial VA tool.
Creating Butterflies in the Core --- A Network Coding Extension for MPLS/RSVP-TE
Authors: Thorsten Biermann, Arne Schwabe, Holger Karl
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

Network Coding exploits network resources more efficiently than plain routing. Specifically, it reduces packet delays and packet loss rates. Such advantages are especially useful in core networks where many different users can benefit from this at once. Hence, network coding should be transparently integrated in technologies suitable for core networks. We present an extension for MPLS and RSVP-TE which can instantiate network-coded paths in core networks. The feasibility of this approach is demonstrated in a proof-of-concept simulation.
Fifth-order mean Runge-Kutta methods applied to the Lorenz system
Authors: Noorhelyna Razali, Rokiah Rozita Ahmad, Maslina Darus, Azmin Sham Rambely
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

In this paper, the fifth-order Runge-Kutta methods is applied to the Lorenz system. The modified fifth-order methods using arithmetic mean were compared with another method using harmonic mean with the same order. Comparisons made between two time steps and the accuracy of all methods from a non-chaotic to a chaotic system was discussed.