ppxscal/embedding_network huggingface dataset:
Eucalyptus: a web service-enabled e-infrastructure
Authors: Sandy Liu, Yong Liang, Martin Brooks
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

With the support of user configurable high speed networks, the emerging e-Infrastructure allows seamless sharing of expensive scientific resources. These resources are often running on a variety of platforms, have different bandwidth and QoS requirements, require specific configuration by technical experts, and in most cases cannot be accessed through a single point of entry. To address these issues, we propose an extensible, reliable, and simple software architecture to share the applications and resources over hybrid networks, and hide the tools' logistical and provisioning complexities. This paper explores the design and implementation of Eucalyptus, and describes how it leverages the benefits of a Service-oriented Architecture (SoA) to provide a highly adaptable, modular, and loosely coupled solution to configure and manage resources needed by users collaborating over the net. We present our methodology to wrap functions of resources into Web services, and integrate the new Web services into the Eucalyptus platform in a generic way. The streams of the events from these resources are captured. This information is used for monitoring resources' activities and diagnosing any error that may arise. We provide a workflow management service allowing users to orchestrate services based on the description of the resources, their dependencies and the captured streams to perform certain tasks. We also propose a combination of Web services and peer to peer technologies to support users in different communities and different network layers, and to decentralize resource management. Eucalyptus was demonstrated to be effective in assisting architects across multiple sites to effectively participate in a shared design session.
Proving Completeness of Properties in Formal Verification of Counting Heads for Railways
Authors: Sebastian Kinder, Rolf Drechsler
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

The demand for safety of electronic devices is high. Especially in safety-critical systems, e.g. electronic railway interlocking systems, safety is an important issue. Nowadays these systems are tested and simulated with a manually created set of test cases. But testing is a very cost-intensive procedure and can never reach a complete coverage for large designs. Hence, an efficient way to formally verify these systems is required. In this paper we present the formal verification of Counting Heads for railways, a real-time system that is used in most electronic railway interlocking systems from SIEMENS. For the verification bounded model checking algorithms are applied, i.e. a set of properties is formally proven. The completeness of this set is also determined effi- ciently.
Recognition Strategies in Machine Vision Applications
Authors: Hiroshi Sako
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Since the 1970's, we have been developing technologies in industrial machine vision including intelligent character recognition to produce automated machines for factories, banks, and post offices. In my talk, I will first introduce a brief history of the industrial machine vision and the intelligent character recognition technologies in applied fields. Then I will discuss the strategies and developments in the fields. I will end my talk by touching on my personal experience as a researcher.
Improved Methods of Maximum a Posteriori Restoration
Authors: H. J. Trussell
Venue: IEEE Transactions on Computers (1979)

An improved numerical solution method for maximum a posteriori image restoration is presented. Results of the use of this method are shown to be superior to previous MAP restorations and equal or better than some common linear restorations. A natural convergence criterion is defined and shown to be a good indicator of restoration quality. The effects of the parameters of the MAP restorations are discussed.
A methodology for timing model characterization for statistical static timing analysis
Authors: Zhuo Feng, Peng Li
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

While the increasing need for addressing process variability in sub-90nm VLSI technologies has sparkled a large body of statistical timing and optimization research, the realization of these techniques heavily depends on the availability of timing models that feed the statistical timing analysis engine. To target at this critical but less explored territory, in this paper, we present numerical and statistical modeling techniques that are suitable for the underlying timing model characterization infrastructure of statistical timing analysis. Our techniques are centered around the understanding that while the widening process variability calls for accurate non-first-order timing models, their deployment requires well-controlled characterization techniques to cope with the complexity and scalability. We present a methodology by which timing variabilities in interconnects and nonlinear gates are translated efficiently into quadratic timing models suitable for accurate statistical timing analysis. Specific parameter reduction techniques are developed to control the characterization cost that is a function of number of variation sources. The proposed techniques are extensively demonstrated under the context of logic stage timing characterization involving interactions between logic gates and interconnects.
A Proposal of New Join Operators for Sensor Network Databases
Authors: Seungjae Lee, Changhwa Kim, Sangkyung Kim
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Most sensor networks currently used to gather sensing data from a broad environment in which it is very difficult to deploy the existing networks(e.g., internet). Recently, researches on relational database approaches to sensor networks are being tried. There occur, however, some problems in applying directly the traditional relational database concepts into a sensor network. One reason is because the join operator only allows to perform operations on tuples which has exactly same join attribute values. For instance, let us assume a sensor network that two different classes of nodes are randomly scattered in the same area. We cannot get join results to know the relationship between two different classes of sensing values because there might be no nodes at a exactly same location. For a solution about the above described problem we propose in this paper new join operators. These new join operators can provide more effective data management and standard interfaces to application programs in sensor networks.
How late can you update gaze-contingent multiresolutional displays without detection?
Authors: Lester C. Loschky, Gary S. Wolverton
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2007)

This study investigated perceptual disruptions in gaze-contingent multiresolutional displays (GCMRDs) due to delays in updating the center of highest resolution after an eye movement. GCMRDs can be used to save processing resources and transmission bandwidth in many types of single-user display applications, such as virtual reality, video-telephony, simulators, and remote piloting. The current study found that image update delays as late as 60 ms after an eye movement did not significantly increase the detectability of image blur and/or motion transients due to the update. This is good news for designers of GCMRDs, since 60 ms is ample time to update many GCMRDs after an eye movement without disrupting perception. The study also found that longer eye movements led to greater blur and/or transient detection due to moving the eyes further into the low-resolution periphery, effectively reducing the image resolution at fixation prior to the update. In GCMRD applications where longer saccades are more likely (e.g., displays with relatively large distances between objects), this problem could be overcome by increasing the size of the region of highest resolution.
An Opto-Mechanical Apparatus for Binocular Helmholtz Stereopsis in Static and Dynamic Scenes
Authors: Wagner Barros, Rodrigo Carceroni, Lara Coelho, Jose Queiroz-Neto
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

This paper presents an opto-mechanical apparatus for binocular stereopsis based on the Helmholtz reciprocity principle. The proposed system makes it possible to obtain three-dimensional models of static and dynamic scenes with arbitrary reflectance properties including highly specular surfaces and holograms. We also propose an empirical methodology for the treatment of occlusions that improves the description of half-occluded areas. Experimental results with real images validate the proposed system.
Special Feature Mycin: Implementing the Expert System in Loglisp
Authors: S. Narain
Venue: IEEE Software (1985)

A translation of Mycin, an expert system used in medical consultations, into Loglisp, a logic programming system, is comparable in terms of clarity, speed, and space requirements.
Tutorial Series 13 Computer Memory Systems
Authors: A. V. Pohm
Venue: Computer (1981)

Because there are no very fast, cheap, reliable memories on the technological horizon, memory hierarchies will continue to play a key role in computer system design.
Cost-effective Heuristics for Workflow Scheduling in Grid Computing Economy
Authors: Yingchun, Xiansong Li, Chenxia Sun
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The increasing demand for grid computing resources calls for an incentive-compatible pricing mechanism for differentiated service qualities. Costeffective scheduling of grid workflow applications described by Directed Acyclic Graph (DAG) becomes an essential and complex problem. In general, the optimization problem is NP-hard, and heuristics are among the methods of choice. In this paper, in order to taking advantage of the workflow deadline, several priority rules are developed, which take into account both activity information and service levels information. To invalidate their effectiveness, these priority rules are applied to different initial solutions. Computational experiments show that two heuristics combining priority rules GRBPA, GRPA with starting solution HL can achieve the better results than heuristics based on other priority rules.
A Physical Activities Healthcare System Based onWireless Sensing Technology
Authors: Zhi Li, Guanglie Zhang
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper, a Physical Activities Healthcare System (PATHS) combined ubiquitous computing and wireless sensing technology was proposed. This system includes a wearable wireless sensors unit (W2SU), a hand-held device and related analysis and wireless communication software. W2SU can record physical activities and ambulatory electrocardiogram. All data recorded by the unit can be transmitted to the hand-held device using Bluetooth in order that the software in hand-held device will monitor the entire exercises process and check the heart rate. Furthermore, the hand-held device can access Internet via Wi-Fi for telemedicine functions. The purposes of our system are to help subjects to develop individuated suitable physical activity plans and monitor the cardiac status continually. PATHS can also be used as an alert device to help person when abnormal rhythms is detected. The prototype system has been tested and it is found to fulfill the anticipated requirement. The proposed system provides an effective solution for construction of a large scale healthcare and telemedicine system.
Fast Recovery and QoS Assurance in the Presence of Network Faults for Mission-Critical Applications in Hostile Environments
Authors: Shrirang Gadgil, Balakrishnan Dasarathy, Frederick Porter, Kirthika Parmeswaran, Ravi Vaidyanathan
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In a hostile military environment, systems must be able to detect and react to catastrophes in a timely manner in order to provide assurance that critical tasks will continue to meet their timeliness requirements. Our research focuses on achieving network quality of service (QoS) assurance using a Bandwidth Broker in the presence of network faults in layer-3 networks. Passive discovery techniques using the link-state information from routers provide for rapid path discovery which, in turn, leads to fast failure impact analysis and QoS restoration. In addition to network fault tolerance, the Bandwidth Broker must be fault tolerant and must be able to recover quickly. This is accomplished using a modified commercially available and open-source inmemory database cluster technology.
How mutation and selection solve long-path problems in polynomial expected time
Authors: Günter Rudolph
Venue: Evolutionary Computation (1996)

It is shown by means of Markov chain analysis that unimodal binary long-path problems can be solved by mutation and elitist selection in a polynomially bounded number of trials on average.
Language morphology offset: Text classification on a Croatian-English parallel corpus
Authors: M. Malenica, T. Šmuc, J. Šnajder, B. Dalbelo Bašić
Venue: Information Processing and Management: an International Journal (2008)

We investigate how, and to what extent, morphological complexity of the language influences text classification using support vector machines (SVM). The Croatian-English parallel corpus provides the basis for direct comparison of two languages of radically different morphological complexity. We quantified, compared, and statistically tested the effects of morphological normalisation on SVM classifier performance based on a series of parallel experiments on both languages, carried over a large scale of different feature subset sizes obtained by different feature selection methods, and applying different levels of morphological normalisation. We also quantified the trade-off between feature space size and performance for different levels of morphological normalisation, and compared the results for both languages. Our experiments have shown that the improvements in SVM classifier performance is statistically significant; they are greater for small and medium number of features, especially for Croatian, whereas for large number of features the improvements are rather small and may be negligible in practice for both languages.
Checker Design for On-line Testing of Xilinx FPGA Communication Protocols
Authors: Martin Straka, Jiri Tobola, Zdenek Kotasek
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

In the paper, a methodology of developing checkers for communication protocol testing is presented. It was used to develop checker to test IP cores communication protocol implemented in Xilinx FPGA based designs. A formal language enabling to describe the protocol was created for this purpose together with a generator of the formal description into VHDL code. The VHDL code can be then used for the synthesis of the checker structure and used in applications with Xilinx FPGAs.
Convective scheme solution of the Boltzmann transport equation for nanoscale semiconductor devices
Authors: D. A. Fixel, W. N. G. Hitchon
Venue: Journal of Computational Physics (2007)

A model for the simulation of the electron energy distribution in nanoscale metal-oxide-semiconductor field-effect transistor (MOSFET) devices, using a kinetic simulation technique, is implemented. The convective scheme (CS), a method of characteristics, is an accurate method of solving the Boltzmann transport equation, a nonlinear integrodifferential equation, for the distribution of electrons in a MOSFET device. The method is used to find probabilities for use in an iterative scheme which iterates to find collision rates in cells. The CS is also a novel approach to 2D semiconductor device simulation. The CS has been extended to handle boundary conditions in 2D as well as to calculation of polygon overlap for polygons of more than three sides. Electron energy distributions in the channel of a MOSFET are presented.
Investigating the Impact of Convergence on the International Spectrum Regulatory Framework
Authors: Jerome Louis, Kim Mallalieu
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

The International Spectrum Regulatory Framework has been conceived about a century ago and has since been periodically improved. Under this framework, decisions regarding the uses to be made of radio spectrum bands are taken during World Radio Conferences (WRCs) which are held under the aegis of the International Telecommunication Union (ITU). This framework, based primarily on the radiocommunication service definition and traditional spectrum allocation norms, is now being challenged by various contemporary technologies and the advent of convergence. This paper shows, by means of a mathematical model based on set theory, that service definitions and spectrum allocations are tightly linked to the concept of vertical integration. It argues that these, particularly the fixed, mobile (except aeronautical and maritime mobile) and broadcasting services, are increasingly under threat as a result of the paradigm shift from vertical to horizontal integration. This paper explains how the said framework has adequately enabled interference management for the past century and why convergence has rendered it ineffective. It finally makes observations on the ITU options to improve the international spectrum management framework and concludes that the options proposed so far are limitative and conservative.
The Design of Large Scale U-IT Application USN by USN Middleware
Authors: Hui-dong Ju, Hyuk-jin Lim, Hyun Yoe
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Recently, the research trend and developmental tendency of ubiquitous computing technologies have been heading in the direction which seamlessly provides the optimum service to users through context-awareness, analogy and networking with various sensor nodes. There is an overwhelming need to develop the USN middleware platforms that have the functions for processing data, monitoring, merged communication environments and mutual compatibility with a variety of sensor networks. While research on a base technique in regard to hardware and communication of sensor networks is actively advancing, the middleware technique is still in the early stages. This paper identifies some drawbacks in the previous work. USN middleware was proposed to control application services through context-awareness processing, information collection from sensor networks and design of event-centric architecture.
Periodic Growing of Two Populations Intergrowth System
Authors: Ying Gao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper, a two populations intergrowth system with two positive parameters is considered. By using the Krasnoselskii's fixed point theorem, the existence results of periodic solutions are obtained. The obtained results are mainly dependent on the parameters.
A web-based learning environment supporting inquiry through playful design experience
Authors: Tracy Kwei-Liang Ho
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper describes our web-based design, Juming Museum Explorer (http://artsnsc.tmue.edu.tw/juming-en/index.html) to support students' inquiry learning. By integrating educational theory with advanced technology, we provide students with a fun and playful environment where they can explore, experience, and create their original work. We chose the Juming Museum in Taiwan as an example where we can apply our general model to improve the students' learning in Art and Art Appreciation. We believe that our design experience can be generalized to other subject areas. This is a condensed English version of a web learning website http://arts.edu.tw/ that we designed and have successfully used in Taiwan schools.
Emotion Classification of Mandarin Speech Based on TEO Nonlinear Features
Authors: Gao Hui, Chen Shanguang, Su Guangchuan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

To study effective speech features which can represent different emotion styles in mandarin speech, nonlinear features based on Teager Energy Operator(TEO) are researched. Neutral state and 3 emotional states (i.e. happiness, anger and sadness) are classified from the mandarin speech database. MFCC extraction and HMM-based emotion recognition are used as baseline system to evaluate the emotional classification performance of TEO-based features. In comparison with MFCC, while text-dependent, improvements of classification capacity are obtained when using all 4 nonlinear features (i.e. NFD_Mel , AF_Mel, DAF_Mel, AM_SBCC). While text-independent, the performance of emotion classification are improved by using NFD_Mel , AF_Mel and DAF_Mel , but deteriorated by using AM_SBCC. The results of classification demonstrate that the nonlinear features based on TEO, when using NFD_Mel, AF_Mel and DAF_Mel, are better able to represent different emotion styles in speech than that of MFCC.
A Novel Provably Secure Anonymous Communication (PSAC) Scheme
Authors: Jian Ren, Lein Harn, Tongtong Li
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Anonymity is increasingly important for network communications concerning about censorship and privacy. Early research on source anonymous communication protocols generally stems from mixnet and DC-net. They either cannot provide provable anonymity or suffer from transmission collision. To solve this problem, a k-anonymous protocol based on hierarchical ring structure and mix technique was proposed. This proposed protocol is collision free and provides provable k-anonymity for both the sender and the recipient. However, this protocol requires the trustworthiness of k honest nodes, therefore, anonymity is only conditional. Alternatively, in this paper, we propose a provably secure anonymous communication (PSAC) scheme without relying on any trusted third parties. While ensuring the message sender anonymity, it can also provide message content authenticity. The proposed PSAC scheme can prevent tracing the senders of messages and limits the disruption that can be caused by participants.
Computing explanations for unlively queries in databases
Authors: Guillem Rull, Carles Farré, Ernest Teniente, Toni Urpí
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

A query is unlively if it always returns an empty answer. Debugging a database schema requires not only determining unlively queries, but also fixing them. To the best of our knowledge, the existing methods do not provide the designer with an explanation of why a query is not lively. In this paper, we propose a method for computing explanations that is independent of the particular method used to determine liveliness. It provides three levels of search: one explanation, a maximal set of non-overlapping explanations, and all explanations. The first two levels require only a linear number of calls to the underlying method. We also propose a filter to reduce the number of these calls, and experimentally compare our method with the best known method for finding unsatisfiable subsets of constraints.