ppxscal/embedding_network huggingface dataset:
The Demaq system: declarative development of distributed applications
Authors: Alexander Böhm, Erich Marth, Carl-Christian Kanne
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The goal of the Demaq project is to investigate a novel way of thinking about distributed applications that are based on the asynchronous exchange of XML messages. Unlike today's solutions that rely on imperative programming languages and multi-tiered application servers, Demaq uses a declarative language for implementing the application logic as a set of rules. A rule compiler transforms the application specifications into execution plans against the message history. The plans are evaluated using our optimized runtime engine. This allows us to leverage existing knowledge about declarative query processing for optimizing distributed applications.
Body sensor network security: an identity-based cryptography approach
Authors: Chiu C. Tan, Haodong Wang, Sheng Zhong, Qun Li
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

A body sensor network (BSN), is a network of sensors deployed on a person's body, usually for health care monitoring. Since the sensors collect personal medical data, security and privacy are important components in a body sensor network. At the same time, the collected data has to readily available in the event of an emergency. In this paper, we present IBE-Lite, a lightweight identity-based encryption suitable for sensors, and developed protocols based on IBE-Lite for a BSN.
Liveness Detection for Biometric Systems Based on Papillary Lines
Authors: Martin Drahansky, Dana Lodrova
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This paper deals with an add-on for biometric security systems, especially for the fingerprint recognition technology. This added part of such systems is the liveness detection. Our method is based on detection of optical characteristics of the finger surface (skin). The main idea is to detect the movements of papillary lines, but some another optical information could be extracted, what is outlined at the end.
Distributivity between uninorms and nullnorms
Authors: Józef Drewniak, Paweł Drygaś, Ewa Rak
Venue: Fuzzy Sets and Systems (2008)

Recently the distributivity equation was investigated in families of certain operations (e.g. triangular norms, conorms, uninorms and nullnorms). Generally, the assumption of associativity is not necessary in consideration of distributivity equation. Moreover, if we omit commutativity assumption, consideration of the left and right distributivity conditions is reasonable. Previous results about distributivity between uninorms and nullnorms can be obtained as simple corollaries.
A multiunit ADI scheme for biharmonic equation with accelerated convergence
Authors: X-H. Tang, C. I. Christov
Venue: International Journal of Computational Science and Engineering (2007)

We consider the problem of acceleration of the Alternative Directions Implicit (ADI) scheme for Dirichlet problem for biharmonic equation. The second Douglas scheme is used as the main vehicle and two full time steps are organised in a single iteration unit in which the explicit operators are arranged differently for the second step. Using an a priori estimate for the spectral radius of the operator, we show that there exists an optimal value for the acceleration parameter. An algorithm is devised implementing the scheme and the optimal range of the parameter is verified through numerical experiments. One iteration unit speeds up the convergence from two to three times in comparison with the standard ADI scheme. To obtain more significant acceleration for the cases when the standard ADI scheme has extremely slow convergence, a generalised multiunit scheme is constructed by introducing another acceleration parameter and treating two consecutive iteration units as one basic element.
Automated Formal Analysis of a Protocol for Secure File Sharing on Untrusted Storage
Authors: Bruno Blanchet, Avik Chaudhuri
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

We study formal security properties of a state-of-the-art protocol for secure file sharing on untrusted storage, in the automatic protocol verifier ProVerif. As far as we know, this is the first automated formal analysis of a secure storage protocol. The protocol, designed as the basis for the file system Plutus, features a number of interesting schemes like lazy revocation and key rotation. These schemes improve the protocol's performance, but complicate its security properties. Our analysis clarifies several ambiguities in the design and reveals some unknown attacks on the protocol. We propose corrections, and prove precise security guarantees for the corrected protocol.
A Distributed Coordination Protocol for Multiple Peer Processes
Authors: Ailixier Aikebaier, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper, we discuss a fully distributed unstructured P2P system where there is no centralized coordinator. Each process makes by itself a decision on an agreement value to realize some objectives by communicating with other processes in a group. Each process first takes a value v in a domain Di which is a collection of possible values and notifies the other processes of the value v. A process in turn receives values from other processes. Unless a set of the values satisfy an agreement condition, a process can take an other value v', differently from the traditional consensus protocols. In human societies, people change their opinions in an agreement procedure. Types of precedent relations on values are discussed to show which value v2 to be taken after a value v1 is taken. An existentially precedent relation shows a process pi can take a value v2 after taking v1. In addition, values are ordered in the preferentially precedent relation. A history of a process pi is a sequence of values which pi has taken. Some value may not be taken multiple times. Each value is characterized in terms of the maximum number of occurrences in a history. If a process pi finds some mistake on selecting a value at a previous round, the process would like to roll back to the previous round. A process takes a checkpoint at a round. The process pi can roll back to the checkpoint most recently taken. In this paper, we discuss the checkpoint mechanism in the coordination protocol. Based on the precedent relations and checkpoints, each process takes the most preferable value v' in the values which are changeable from current value v.
A General Failure Candidate Ranking Framework for Silicon Debug
Authors: Chia-Chih Yen, Ten Lin, Hermes Lin, Kai Yang, Tayung Liu, Yu-Chin Hsu
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

In advanced nanometer designs, various electrical effects could introduce unexpected circuit delays and lead to performance failures. Although electrically induced timing errors could be detected by applying delay testing, tools for debugging this type of error are still not widely adopted. We propose a general silicon debug framework which focuses on diagnosing silicon electrical bugs under functional test patterns. In this paper, we present FCR (Failure Candidate Ranker) which is one of the key compo-nents of the proposed framework. FCR employs various reasoning techniques including backward active/trigger tracing and forward symptom matching. We’ll apply FCR to several industrial cases and show the effectiveness of identifying the error sources.
A Framework for IMS Interworking Networks with Quality of Service Guarantee
Authors: Jinho Hwang, Nakpo Kim, Sangyong Kang, Jongseog Koh
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The IP Multimedia Subsystem (IMS) could very well be the best solution for most telecom operators. The more recent releases have included interfaces to fixed line networks and Wireless LANs. This has consequences both for the migration of the core network as well as the integration of future mobile services and applications. Also, an interworking between IMS providers is considered to be a major step toward End-to-End IMS services and IPX (IP Interworking Exchanged) networks are introduced as the requirement to support QoS features in GSMA. But these architectures don’t specify any requirements for e2e QoS through IPX networks. This purpose of this article is to research of IMS interworking Network for enlarging IMS services guaranteeing e2e services quality and we suggest the IMIN (IMS Interworking Network) framework to guarantee IMS high quality end-to-end services.
Crystal Reports XI Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use Crystal Reports XI. The following topics are covered: Creating, Opening, Saving Reports, Using Report Wizards, Changing Defaults and Reports Options, Inserting Fields from a Database, Inserting Text Fields, Moving/Resizing Objects, Using Guides, Formatting Objects, Sorting, Grouping, Grouping in Specified Order, Editing Groups, Inserting Subtotals, Grand Totals, Summary Fields, Record Selection and Criteria, Creating Static Parameters, Creating Cascading Parameters, Applying a Parameter to the Report, Prompting for New Parameter Values, Creating Formulas, Using a Formula Field, Editing a Formula, Using a Formula to Provide Value to a Control, Renaming a Formula, Syntax Considerations, Editing Tables and Relationships. Also includes a list of keyboard shortcuts and selection methods. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user
Jump diffusion model with application to the Japanese stock market
Authors: Koichi Maekawa, Sangyeol Lee, Takayuki Morimoto, Ken-ichi Kawai
Venue: Mathematics and Computers in Simulation (2008)

In this paper we demonstrate that a jump diffusion model is better fitted to Japanese stock data in the Nikkei 225 than the classical Black-Scholes (BS) model. In order to check the existence of jumps, we implement the bipower test by Barndorff-Nielsen and Shephard [O.E. Barndorff-Nielsen, N. Shephard, Econometrics of testing for jumps in financial economics using bipower variation, Unpublished discussion paper, Nuffield College, Oxford, 2004], which reveals that Japanese stock data has jumps. For modeling the data, we choose Kou's [S.G. Kou, A jump diffusion model for option pricing, Manage. Sci. 48 (2002) 1086-1101] model for its tractability and rich theoretical implications. We compare the option prices obtained from Kou's and BS' models with real market prices. The comparison study confirms that Kou's model outperforms the BS model.
IOmeter performance comparison of SBOD and MBOD
Authors: Franck Chevalier, Roland Ibbett, Tim Courtney
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In this paper, the performance of the emerging Switched Bunch Of Disks (SBOD) RAID architecture is compared to the more traditional Managed Bunch Of Disks (MBOD) using both analytical and simulation models. The benchmark used for this comparison is the conventional IOmeter that enables Throughput and IOPS of these systems to be compared. The SBOD configuration that maximises its performance is first investigated. Using both analytical and simulation models, it was found that the SBOD performs between 104% to 275% better than the MBOD, depending on the size of the requests in the IOmeter traffic workload.
Teaching game programming using XNA
Authors: Joe Linhoff, Amber Settle
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

As educators work to expand the audience interested in computer science, computer gaming programs have blossomed at a variety of educational institutions. Educators are coming to recognize that gaming is a compelling way to motivate students to learn challenging technical concepts such as programming, software engineering, algorithms, and project management. At the core of many gaming programs are game development courses, which teach technical aspects about software development in a motivating environment. While many game development courses share a common goal, the structure and goals of game development courses can be quite diverse. We describe a game development course that uses the XNA platform to allow a heterogeneous group of students to gain experience in all aspects of console game creation, an approach we believe has some interesting pedagogical benefits.
A Logic for Virtual Memory
Authors: Rafal Kolanski
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing classical separation logic notation to be used at an abstract level. We demonstrate that in the common cases, such as user applications, our logic reduces to classical separation logic. At the same time we can express properties about page tables, direct physical memory access, virtual memory access, and shared memory in detail.
Database Support for Discovering Patterns in Large Datasets Collected from Multiple Sensors
Authors: Richard A. Wasniowski
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

A large number of applications require mining high rate data streams. An important challenge in dealing with such data intensive applications is fast data change rate that requires improved analysis, new algorithms, tools and techniques. Our purpose for this work is to examine how to integrate collecting data streams from multiple sensors in order to discover new patterns and minimize the number of incorrect alarms. We present a framework for mining patterns from data streams and discuss practical applications.
Linear Algebra: Ideas and Applications, 3 edition
Authors: Richard C. Penney
Venue:  (2008)

This expanded new edition presents a thorough and up-to-date introduction to the study of linear algebra Linear Algebra, Third Edition provides a unified introduction to linear algebra while reinforcing and emphasizing a conceptual and hands-on understanding of the essential ideas. Promoting the development of intuition rather than the simple application of methods, the book successfully helps readers to understand not only how to implement a technique, but why its use is important. The book outlines an analytical, algebraic, and geometric discussion of the provided definitions, theorems, and proofs. For each concept, an abstract foundation is presented together with its computational output, and this parallel structure clearly and immediately illustrates the relationship between the theory and its appropriate applications. The Third Edition also features: * A new chapter on generalized eigenvectors and chain bases with coverage of the Jordan form and the Cayley-Hamilton theorem * A new chapter on numerical techniques, including a discussion of the condition number * A new section on Hermitian symmetric and unitary matrices * An exploration of computational approaches to finding eigenvalues, such as the forward iteration, reverse iteration, and the QR method * Additional exercises that consist of application, numerical, and conceptual questions as well as true-false questions Illuminating applications of linear algebra are provided throughout most parts of the book along with self-study questions that allow the reader to replicate the treatments independently of the book. Each chapter concludes with a summary of key points, and most topics are accompanied by a "Computer Projects" section, which contains worked-out exercises that utilize the most up-to-date version of MATLAB(r). A related Web site features Maple translations of these exercises as well as additional supplemental material. Linear Algebra, Third Edition is an excellent undergraduate-level textbook for courses in linear algebra. It is also a valuable self-study guide for professionals and researchers who would like a basic introduction to linear algebra with applications in science, engineering, and computer science.
What is masters level education in informatics?
Authors: Michael Caspersen, Lillian Cassell, Gordon Davies, Arnold Pears, Stephen Seidman, Heikki Topi
Venue: ACM SIGCSE Bulletin (2008)

Adoption of the Bologna Accord in the European Higher Education Area (EHEA) represents a concerted move towards harmonisation of educational outcomes in higher education at the Bachelor, Masters and PhD levels. At a time when European systems are undergoing significant examination and modification, this project addresses the need for greater understanding of the nature of Masters level education in the Informatics disciplines across Europe and the United States. The poster presents the current findings of the project, and is intended to prompt discussion about the content and expected outcomes of such programmes world-wide.
Second international workshop on ultra-large-scale software-intensive systems (ULSSIS 2008)
Authors: Kevin Sullivan, Rick Kazman
Venue: Companion of the 30th international conference on Software engineering (2008)

Software-intensive systems now being envisioned and in some cases developed will surpass complexity thresholds beyond which established software engineering concepts, methods and tools no longer work well. ULSSIS provides a forum in which researchers from industry, academia and governments come together to understand these issues and to discuss research and development activities to address them.
Hang analysis: fighting responsiveness bugs
Authors: Xi Wang, Zhenyu Guo, Xuezheng Liu, Zhilei Xu, Haoxiang Lin, Xiaoge Wang, Zheng Zhang
Venue: Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 (2008)

Soft hang is an action that was expected to respond instantly but instead drives an application into a coma. While the application usually responds eventually, users cannot issue other requests while waiting. Such hang problems are widespread in productivity tools such as desktop applications; similar issues arise in server programs as well. Hang problems arise because the software contains blocking or time-consuming operations in graphical user interface (GUI) and other time-critical call paths that should not. This paper proposes HangWiz to find hang bugs in source code, which are difficult to eliminate before release by testing, as they often depend on a user's environment. HangWiz finds hang bugs by finding hang points: an invocation that is expected to complete quickly, such as a GUI action, but calls a blocking function. HangWiz collects hang patterns from runtime traces supplemented with expert knowledge, and feed these patterns into a static analysis framework that searches exhaustively for hang points that involve potential hang bugs. Experiments with several large, real-world software packages (including a source control client, a graphics editor and a web server) show that there are several hang bugs in these applications, and that HangWiz is effective in finding them. The experiments also demonstrate that HangWiz is scalable and can analyze millions of lines of code. We further discuss related techniques and report our experience on fixing hang bugs.
Big Crook in Little China: The Ramifications of the Hong Kong BitTorrent Case on the Criminal Test of Prejudicial Effect
Authors: Michael Filby
Venue: International Review of Law, Computers and Technology (2007)

The ongoing problem of digital file sharing technology evolving at a speed far greater than the law can keep up with is demonstrable with litigation upheld against the producers of peer-to-peer networks such as Grokster1 towards the ends of their natural useful lives. As file sharers and, with them, copyright infringers, move onto more efficient networks such as BitTorrent, the story is repeated but with the new problem of the client software being open source. This has led to avenues alternative to litigating against makers of peer-to-peer network clients being explored. Perspectives on what constitutes "to affect prejudicially the owner of the copyright" as laid out in the CDPA 1988 are considered in light of the Hong Kong case of HKSAR v. Chan Nai-Ming. It is argued that the highly strict and surprisingly low level at which the test for prejudicial effect is set is counter-intuitive to the goals of curbing the problems piracy poses. It is concluded that the ongoing battle between file sharers and their opponents has led to the loss of sight of the true goal of regulation: the protection of copyright holders from suffering de facto harm that is at least above a relatively negligible standard.
Sensor network based on mutual communications with reliability index
Authors: Takeshi Fujiwara, Kensuke Komatsu, Hiroyuki Takahashi, Masaharu Nakazawa, Yoshiki Shimomura
Venue: Proceedings of the 9th International Conference on Circuits (2005)

In the environment such as outer space where we cannot maintain the artifacts, it is the robustness that is important for artifacts. Thus the system which has the information processing circuit realizing self-maintenance function is desirable. So far some approach is tried to realize self-maintenance function using the qualitative reasoning technique. In this study, we try to apply distributed information processing technique to this qualitative reasoning information processor, by arranging many operating homogeneous units onto an application specific integrated circuit (ASIC). Now we are investigating the way mounting the self-maintenance logic on large scale artifact.
Design and implementation of a framework for persistent identification and communication in emerging networks
Authors: Joud S. Khoury, Henry Jerez, Luca De Cicco
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

The Internet Protocol (IP) is currently used to provide inter-networking among heterogeneous access networks. However, the evolution of and the innovation within these networks is greatly hindered by the geographical and topological rigidness of the protocol implementation that hinders the support for flexible unstructured communication paradigms. To broaden the user's innovation space and to efficiently embrace the characteristics of these emerging unstructured networks, clean-slate architectural approaches are being pursued. In this paper, we present the Persistent Identification and NeTworking research framework (PINT); an implementation of the Transient Network Architecture (TNA) currently being developed between the University of New Mexico and the Corporation for National Research Initiatives. PINT provides the research community with a modular and extensible set of networking components and primitives that enable novel research and experimentation atop a persistently identified networking platform. This technology provides a ground for inter-networking of heterogeneous communication networks where novel networking primitives are exposed through the Persistent Identification and Networking Layer (PINL), allowing mobile and stationary entities to communicate securely based on persistent identifiers that are location independent.