ppxscal/embedding_network huggingface dataset:
Validating Documentation with Domain Ontologies
Authors: Leonid Kof, Markus Pizka
Venue: Proceeding of the 2005 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fourth SoMeT_W05 (2005)

Do we always use the same name for the same concept? Usually not. While misunderstandings are always troublesome, they pose particularly critical problems in software projects. Requirements engineering deals intensively with reducing the number and scope of misunderstandings between software engineers and customers. Software maintenance is another important task where proper understanding of the application domain is vital. In both cases it is necessary to gain (or regain) domain knowledge from existing documents that are usually inconsistent and imprecise. This paper proposes to reduce the risk of misunderstandings by unifying the terminology of the different stakeholders with the help of an ontology. The ontology is constructed by extracting terms and relations from existing documents. Applying text mining for ontology extraction has an unbeatable advantage compared to manual ontology extraction: Text mining detects terminology inconsistencies before they are absorbed in the ontology. In addition to this, the approach presented in this paper also introduces an explicit validation of ontology gained by text mining.
Prediction of periventricular leukomalacia. Part I: Selection of hemodynamic features using logistic regression and decision tree algorithms
Authors: Biswanath Samanta, Geoffrey L. Bird, Marijn Kuijpers, Robert A. Zimmerman, Gail P. Jarvik, Gil Wernovsky, Robert R. Clancy, Daniel J. Licht, J. William Gaynor, Chandrasekhar Nataraj
Venue: Artificial Intelligence in Medicine (2009)

Objective: Periventricular leukomalacia (PVL) is part of a spectrum of cerebral white matter injury which is associated with adverse neurodevelopmental outcome in preterm infants. While PVL is common in neonates with cardiac disease, both before and after surgery, it is less common in older infants with cardiac disease. Pre-, intra-, and postoperative risk factors for the occurrence of PVL are poorly understood. The main objective of the present work is to identify potential hemodynamic risk factors for PVL occurrence in neonates with complex heart disease using logistic regression analysis and decision tree algorithms. Methods: The postoperative hemodynamic and arterial blood gas data (monitoring variables) collected in the cardiac intensive care unit of Children's Hospital of Philadelphia were used for predicting the occurrence of PVL. Three categories of datasets for 103 infants and neonates were used-(1) original data without any preprocessing, (2) partial data keeping the admission, the maximum and the minimum values of the monitoring variables, and (3) extracted dataset of statistical features. The datasets were used as inputs for forward stepwise logistic regression to select the most significant variables as predictors. The selected features were then used as inputs to the decision tree induction algorithm for generating easily interpretable rules for prediction of PVL. Results: Three sets of data were analyzed in SPSS for identifying statistically significant predictors (p
Stabilization of a string with two rigid loads: application of optimal feedback gain based on a finite difference approximation
Authors: Hideki Sano
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

This paper is concerned with the problem of stabilizing a string with two rigid loads which is described by two kinds of hyperbolic equations. In our previous work, a control law that made an energy function of the system non-increasing was derived, and the asymptotic stability of the closed-loop system with the controller was proved by using the LaSalle's invariance principle. Moreover, a simplified lumped parameter model was considered in connection with the string with two rigid loads, and the design method to determine an optimal feedback gain for the model was proposed. In this paper, it is shown that the controller with an optimal gain based on a finite differnce approximation works more effectively for the original system through numerical simulations.
The Focal Easy Guide to Final Cut Pro 6
Authors: Rick Young
Venue:  (2007)

Software packages are complex. Software books don't need to be. Simplify your life with The Focal Easy Guide to Final Cut Pro! This concise, full-color book lives up to its name by paring down the software to its essentials. You learn the key features and essential workflow to get you up and running in no time. With this book you can start cutting immediately, whatever you edit, whatever the format. This is an ideal introduction whether you are a professional moving over to Final Cut Pro from another package or system, a new user, or just someone who wants to get the best results from Final Cut Pro, fast! * Save time, learn all you need to know to edit with FCP in hours * Concise full-color coverage, suitable for all OSX versions of FCP The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Function approximation in generalized holder spaces and numerical solution of singular integral equations
Authors: Feras M. Al-Faqih
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

The numerical schemes of iterative projection methods for approximate solution of singular integral equations are elaborated. The equations are defined on an arbitrary smooth closed contours. Theoretical foundation is obtained in Generalized Holder spaces.
Test time minimization for hybrid BIST of core-based systems
Authors: Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, Maksim Jenihhin
Venue: Journal of Computer Science and Technology (2006)

This paper presents a solution to the test time minimization problem for core-based systems. We assume a hybrid BIST approach, where a test set is assembled, for each core, from pseudorandom test patterns that are generated online, and deterministic test patterns that are generated off-line and stored in the system. In this paper we propose an iterative algorithm to find the optimal combination of pseudorandom and deterministic test sets of the whole system, consisting of multiple cores, under given memory constraints, so that the total test time is minimized. Our approach employs a fast estimation methodology in order to avoid exhaustive search and to speed-up the calculation process. Experimental results have shown the efficiency of the algorithm to find near optimal solutions.
Upper and lower bounds for recursive fourier sampling
Authors: Leo Harrington
Venue:  (2008)

We define a canonical version of the recursive Fourier sampling problem from quantum complexity theory, and systematically address a variety of its computational properties, including quantum query complexity, classical randomized query complexity, polynomial degree, and circuit size. Our analysis yields improvements for several of the known upper and lower bounds with regard to these complexity measures. For quantum query complexity, we define an explicit reduced-query quantum algorithm for the problem, and recursively construct a quantum circuit that implements the algorithm. For classical query complexity, we give new proofs of the known lower bounds that improve the constants, and we give complete proofs of the complexity class separations relative to oracles, that follow from these bounds. For polynomial degree, we construct an exactly representing real polynomial of extremely low degree, and extend it to representations over other Fields. We show that this degree is exactly optimal, even for a 2 weakly-representing polynomial. For circuit size, we construct a small depth-two circuit for the non-recursive version of the problem, and we show that the size is optimal even if the depth is not restricted. We also prove asymptotically matching upper and lower bounds on circuit size for the full recursive version of the problem when the depth is restricted to two. To prove the tight results for polynomial degree and circuit size we introduce and define a general notion of reduction for both polynomials and circuits that represent boolean functions on a partial domain. We also introduce and define, separately, a new measure of circuit complexity called "effort".
Dynamic Structure-Based Neural Networks Determination Approach Based on the Orthogonal Genetic Algorithm with Quantization
Authors: Hao Rao, Lining Xing
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Simulation optimization studies the problem of optimizing simulation-based objectives. This field has a strong history in engineering but often suffers from several difficulties including being time-consuming and NP-hardness. Simulation optimization is a new and hot topic in the field of system simulation and operational research. This paper presents a hybrid approach that combines Evolutionary Algorithms with Neural Networks for solving simulation optimization problems. In our research, Neural Networks are applied to replace the known simulation model for evaluating subsequent iterative solutions. Further, we apply the dynamic structure-based neural networks to learn and replace the known simulation model. The determination of dynamic structure-based neural networks is the kernel of this paper. The experimental results demonstrated that our approach can find optimal or close-to-optimal solutions, and is superior to other recent algorithms in simulation optimization.
Algorithms and protocols for constrained path selection and fault monitoring in packet networks
Authors: Marwan M. Krunz
Venue:  (2008)

Efficient resource utilization and fast failure recovery are essential design goals of next-generation backbone networks. The need for efficient resource utilization has motivated the development of various protocols and techniques that offer data services over legacy backbone networks such as Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH). Enabling improved utilization with enhanced network reliability requires various network optimizations, both at the protocol and system levels. In this dissertation, we present a set of network optimization techniques that improve the performance of an end-user connected to classical packet networks such as Internet. First, we introduce an efficient path selection algorithm that enables seamless bandwidth upgrade for an existing Ethernet connection over SONET/SDH backbone using virtual concatenation technique. We also provide a heterogenous concatenation technique that improves the bandwidth utilization and that is easy to maintain. Second, we present a novel failure localization technique, that can detect single-link or simultaneous multiple-link failures. This technique is based on constructing a set of monitoring paths and cycles from one or more monitoring locations in the network. Third, we present an efficient routing and wavelength assignment scheme for backbone networks with stale network-state information. Finally, we present an efficient server placement scheme for supporting multiple-description-coding (MDC) based media streaming over content delivery networks. We show that by using MDC-encoded media, intelligent server placement, and efficient path selection, the performance of an end-user can be greatly improved.
Algorithmic Tamper Proof (ATP) Counter Units for Authentication Devices Using PIN
Authors: Yuichi Komano, Kazuo Ohta, Hideyuki Miyake, Atsushi Shimbo
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

Though Gennaro et al. discussed the algorithmic tamper proof (ATP) devices using the personal identification number (PIN) with less tamper-proof devices, and proposed counter units which count the number of wrong attempts in user authentication; however, as for the counter unit, they only constructed one which counts the total number of wrong attempts. Although large number for the limit of wrong attempts is required for usability, it allows an attacker to search PIN up to the limit and degrades the security. The construction of secure counter units which count the number of consecutive wrong attempts remains as an open problem. In this paper, we first formalize the ATP security of counter units, and propose two constructions of counter unit which count the number of consecutive wrong attempts. The security of each construction can be proven under the assumptions of secure signature scheme and random function. The former one is required to store two states in secure memory area (RP ¿ Mem) with low computation cost; and the latter one has high computation cost but is required to store only one state in RP ¿ Mem. This shows the trade-off between the costs of hardware and algorithm.
Segmentation-Based Caching for Mobile Auctions
Authors: Stefan Böttcher, Sebastian Obermeier, Adelhard Türling, Jan Henrik Wiesner
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

Whenever e-commerce applications want to distribute XML data over mobile networks, the limitted battery power requires to reduce the amount of exchanged data. Therefore, we propose a technique to identify parts of the database that are more frequently queried than other parts, to cache these parts, and to reuse them for answering following queries. In this paper, we present a data shipping strategy based on a segmentation of an XML database that not only reduces the amount of transferred data within the whole network, but also simplifies the method of testing whether an intermediate participant that routes a query can contribute to this query. Furthermore, we use the XMark benchmark for experimentally evaluating how the use of our segmentation within a typical mobile auction scenario can reduce the total amount of transferred data.
Why Do Students Engage in e-Learning: A Chinese Perspective
Authors: Zhenhong Zhang, Ronghuai Huang
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper presents a study on how Chinese students understand e-learning. Twenty university students who took part in a course “Introduction to e-learning” were interviewed and data were analyzed using the method of phenomenography. The findings can be presented as four qualitatively different conceptions of e-learning: e-learning as (1) supplement to face-to-face learning or the metaphor of after-meal dissert; (2) informal resource-based learning or the metaphor of a mobile library; (3) activity-based learning or the metaphor of a ladder to knowledge; (4) community-based learning or the metaphor of a food sharing banquet. The aim of the study is to shed light on Chinese students' conceptions of e-learning, which are of significance to e-tutors in offering e-learning services.
After Effects CS3 Professional for Windows and Macintosh: Visual QuickPro Guide, 1st edition
Authors: Antony Bolante
Venue:  (2007)

Here to get filmmakers, Web designers, and broadcast pros up to speed on After Effects CS3 Professional - in time to meet their next deadline, is everyone's favorite task-based guide, but geared toward more advanced users. Through step-by-step instructions, enhanced by tips, sidebars, and plenty of visual aids, veteran video editor Antony Bolante will show you how to effectively and efficiently import and manage footage, view and edit layers, apply effects, animate type, and more. You'll learn about key features with real-world examples of how and when features should be used, including what's new in After Effects CS3: Shape layers, which enables you to easily create and animate shapes; Puppet tool, which you can use to animate a 2D image like a marionette; powerful integration with Photoshop CS3; new support for Flash designers; the new Brainstorm panel, which lets you preview an array of different visual possibilities in one gorgeous panel; complete color management workflow; Adobe Clip Notes, which lets you attach comments directly to a composition; Adobe Device Central CS3, which lets you preview and test animations for mobile devices, and more.
SQLi: towards an interface description language for relational databases
Authors: Hasan M. Jamil, Rong Zhou
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

The advent of Internet and the increase in non-standard use of databases demand support for interface design primitives for ad hoc and user-friendly interface design. In this paper, we propose an interface description sub-language, called the SQLi, as a non-intrusive extension of SQL to facilitate ad hoc interface generation and data display with user preferred overriding capabilities. In support of our proposed extension and as a demonstration of its functional capabilities we introduce our system called SQL/IDL form generator that can be used as an add-on to any relational system as a query front end. We discuss the salient features of the tool and the SQLi extension through an illustrative example and argue that our proposed extension is adaptive enough to accommodate future changes and needs.
Agent Systems in Electronic Business
Authors: Eldon Y. Li, Soe-Tsyr Yuan
Venue: Premier Reference Source (2007)

Agent technologies are believed to be one of the most promising tools to conduct business via networks and the Web in an autonomous, intelligent, and efficient way. The ever-expanding application of business automation necessitates clarification of the methods and techniques of agent-based electronic business systems. Agent Systems in Electronic Business delivers definitive research to academics and practitioners in the field of business automation on the use of agent technologies to advance the practice of electronic business in todays organizations, targeting the needs of enterprises in open and dynamic business opportunities to incorporate skilled use of multiple independent information systems. This comprehensive resource clearly articulates the stages (electronic commerce transactions, business processes and e-business infrastructure) involved in developing agent-based e-business systems.
The development and implementation of a context-based curricular framework for computer science education in high schools
Authors: Christopher W. Starr, Doug Bergman, Phil Zaubi
Venue: ACM SIGCSE Bulletin (2009)

In this paper, we describe a computer science curricular framework for creating innovative, four-year computer science programs for high school computer science courses. Based on a suggested set of great principles of computing by Peter Denning, the framework is structured as a stack of four curricular layers. The result is a framework design that provides a high degree of curricular and pedagogical flexibility, particularly suited for the rapidly changing discipline of computer science. This report describes the computer science curricular framework, the implementation of the framework and the deployment of a four-year curriculum from the implemented framework. Initial classroom experiences are reported.
An Implementation of the CORDRA Architecture Enhanced for Systematic Reuse of Learning Objects
Authors: Freya H. Lin, Timothy K. Shih, Won Kim
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

The Sharable Content Object Reference Model (SCORM) specification defines metadata of learning objects, which are used as the elementary reusable components in distance learning. The Content Object Repository Discovery and Registration/Resolution Architecture (CORDRA) specification provides a common architecture for the resolution, discovery, and sharing of these learning objects. These two specifications together define standardized ways in which learning objects can be discovered and reused by content designers. However, the current CORDRA and the definition of objects in SCORM only allow an object to be copied, updated, and reorganized in a new content aggregation, which is used as a delivery package to end users. This paper proposes a revised CORDRA architecture and a reusability mechanism to make instruction design easier. In particular, it proposes a structure called a reusability tree for tracking the history of reuse of learning objects in CORDRA. This paper also defines the notions of similarity, diversity, and relevancy of learning objects to make it easier for users to precisely search for and reuse learning objects.
An optimized location-based mobile restaurant recommend and navigation system
Authors: Zhi-Mei Wang, Fan Yang
Venue: WSEAS Transactions on Information Science and Applications (2009)

With the widely used of the intelligent mobile phones with the GPS, the location-based services has become the a hot issue of mobile communications research. This paper implements a Mobile Location-based Restaurant Navigation and Recommend System. In order to improve server-side response speed for real-time query, we propose a memory pool model, the expansion Accept command, no-data client polling and interrupt mechanism, which aims to greatly optimize the server-side control procedures. On the client side, we combine the latest Web2.0 application data with the location-based data, and propose a collaborative assessment and recommend mechanisms, which can provide users with real-time location-based restaurant and recommend personalized navigation.
Reliable inter-vehicle communications for vehicular ad hoc networks
Authors: Mohammad Nekoui, Hossein Pishro-Nik
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

Safety message exchange is the most prevalent part of inter-vehicular communications which is crucial for enhancing safety and efficiency in transportation networks. Moreover, since the dissemination of safety messages directly influences our lives, their reliable delivery is of great importance. Most packet collisions in VANETs occur due to hidden nodes. In unicast communications a two-way handshaking is performed prior to the actual transmission in order to alleviate the hidden node problem. However, this procedure congests the network with a lot of overhead in case of broadcast, which is the dominant mode of communication in VANETs. Hence, in this paper we propose an alternative solution, based on retransmissions, to ensure the reliable delivery of safety messages. We argue that the specific characteristics inherent in VANETs, such as the limited density of vehicles, anticipated bandwidth and the tolerable delay, allow us to deploy a retransmission strategy. Furthermore, We prove that our proposed scheme establishes fair channel access for the consecutive retransmission opportunities of contending neighbors. Simulation results confirm that our heuristic method dramatically improves the probability of reception of safety messages regarding conventional methods.
Brief paper: Optimal sensor rules and unified fusion rules for multisensor multi-hypothesis network decision systems with channel errors
Authors: Qing'an Ren, Yunmin Zhu, Xiaojing Shen, Enbin Song
Venue: Automatica (Journal of IFAC) (2009)

In this paper, for general jointly distributed sensor observations, we present optimal sensor rules with channel errors for a given fusion rule. Then, the unified fusion rules problem for multisensor multi-hypothesis network decision systems with channel errors is studied as an extension of our previous results for ideal channels, i.e., people only need to optimize sensor rules under the proposed unified fusion rules to achieve global optimal decision performance. More significantly, the unified fusion rules do not depend on distributions of sensor observations, decision criterion, and the characteristics of fading channels. Finally, several numerical examples support the above analytic results and show some interesting phenomena which can not be seen in ideal channel case.