ppxscal/embedding_network huggingface dataset:
Staircase join: teach a relational DBMS to watch its (axis) steps
Authors: Torsten Grust, Maurice van Keulen, Jens Teubner
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples. This text applies (and adapts) this successful principle to database-supported XML and XPath processing: the relational system is made tree aware, i.e., tree properties like subtree size, intersection of paths, inclusion or disjointness of subtrees are made explicit. We propose a local change to the database kernel, the staircase join, which encapsulates the necessary tree knowledge needed to improve XPath performance. Staircase join operates on an XML encoding which makes this knowledge available at the cost of simple integer operations (e.g., +, ≤ ). We finally report on quite promising experiments with a staircase join enhanced main-memory database kernel.
Three decision levels strategy for Arabic and Latin texts differentiation in printed and handwritten natures
Authors: Mohamed BEN JLAIEL, Slim KANOUN, Adel Mohamed ALIMI, Remy MULLOT
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Arabic and Latin script identification in printed and handwritten nature present several difficulties because the Arabic (printed or handwritten) and the handwritten Latin scripts are cursive scripts of nature. To avoid all possible confusions which can be generated, we propose in this paper a strategy which is based on three decision levels where each level will have its own features vector and will consist in identifying only one script among the scripts to identify.
Investigating antecedents of technology acceptance of initial eCRM users beyond generation X and the role of self-construal
Authors: Qimei Chen, Hong-Mei Chen, Rick Kazman
Venue: Electronic Commerce Research (2007)

eCRM (electronic Customer Relationship Management) systems focus on using the web-site as the main interaction channel for businesses to simulate an old fashioned one-to-one direct relationship--high touch--with customers. In this research two distinct but related concepts, media richness from the Human Computer Interaction and Computer Mediated Communication fields and perceived interactivity from the Marketing and MIS fields, are disentangled and their unique impacts on technology acceptance variables are examined in the eCRM Acceptance Model. The present study contributes in extending the Technology Acceptance Model for the eCRM context and in establishing media richness and perceived interactivity as antecedents to perceived usefulness and perceived ease of use. Our research model integrates system perception (e.g., perceived usefulness and perceived ease of use) and subjective outcome measures (e.g., decision satisfaction) in a single model to fully understand the impact of eCRM "touch" design perceived by e-customers on their intention to return after the initial visit. An experimental survey of two culture groups (independent vs. interdependent self-construal) of technology savvy, young college students reveals that culture value-orientation (e.g., self-construal) moderates the effect of decision satisfaction on behavior intention to return in our eCRM Acceptance model. Findings of this research thus have significant theoretical and managerial implications.
Methodology for Service Restoration Based Adaptive-Selective Tabu Search (ASTS)
Authors: Luciana Cambraia Leite, Joao Onofre Pereira Pinto
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The objective this paper is to present the development methodology, called Adaptive-Selective Tabu Search ASTS, proposed to optimization of the transmission power systems restoration. The methodology is based on Tabu Search (TS) and Reactive Tabu Search (RTS) techniques with elements similar to those found in other Artificial Intelligent Methods, as elitism, aleatority and future analysis. These elements provide diversification and intensification mechanism to the search, beside of the predictive controlled characteristics. The proposed method is applied to the 20-nodes transmission real system and the simulations results obtained are satisfactory as well as the comparisons with other methodologies.
Enabled dynamic tasks planning in Web-based virtual manufacturing environments
Authors: Chulho Chung, Qingjin Peng
Venue: Computers in Industry (2008)

Manufacturing tasks planning decides processes and sequences of product development. The task planning systems developed so far are not fully satisfactory in manufacturing because of islands of automation and uncertainty caused by disregarding resources in real manufacturing environments. This paper discusses dynamic tasks planning enabled by a virtual manufacturing environment (VE) which provides an effective three-dimensional visualization and user intensive interaction. Internet technology is used to provide a feasible tool for the data update and access timely. Manufacturing data can be retrieved through Internet by integrating tasks planning and the Web interface. Therefore, the manufacturing tasks planning in a Web-based VE can utilise technologies of the visualization and resources sharing, which enables a dynamic and efficient use of manufacturing resources. The proposed method provides a solution of cost-effective, platform independent, and sharing visualized information over the Internet for virtual manufacturing. Applications are presented including process planning for shop floor fabrication; assembly planning for product completion; and disassembly planning for the product end-life management.
Fibre Channel based Storage Area Network Modeling using OPNET for Large Fabric Simulations: Preliminary Work
Authors: Joshua Staley, Suresh Muknahallipatna, Howard Johnson
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Fibre channel based storage area networks have been a common implementation for data storage in enterprise data centers. As the size of the storage area network tends to grow along with geographical distribution leading to distributed storage area network, also known as large fabric, the network seems to exhibit scaling and stability issues. The scaling and stability issues seem to stem from the construction, route discovery, and management process of the network which are Fibre channel-2 level traffic more than the actual I/O data transmission process. To determine the scaling and stability issues of a large fabric, an adequate tool is required. The tool is usually a discrete event simulator since an analytical or hardware simulator tool would not be able to handle the large size of the storage area network and model in detail. In this paper, the preliminary work on modeling and simulations of a fibre channel based storage area network using OPNET as a discrete event simulator are presented. As a preliminary step, the fibre channel host bus adapter and its interactions with the fabric login server of a fibre channel switch during the fabric login process is modeled at the fibre channel-2 level and preliminary simulations are performed.
A new dynamic Bayesian network for integrating multiple data in estimating gene networks
Authors: Yu Zhang, Zhidong Deng, Peifa Jia
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

We propose a novel method for estimating a gene regulatory network from both gene expression data and transcription factor binding location data. Based on dynamic Bayesian network (DBN) models, our method has two advantages. First, structural expectation maximization algorithm is embedded into a DBN framework, allowing it to learn the network with unknown structure and incomplete data, which cannot be tackled by expectation maximization algorithm. Second, since learning only from gene expression data is not enough to accurately estimate a gene network, we incorporate transcription factor binding location data through a structure prior. We demonstrate the effectiveness of the proposed method by the analysis of Saccharomyces Cerevisiae cell cycle data. The experimental results show that this new approach suits for dealing with missing values. Furthermore, combination of heterogeneous data from multiple sources ensures that our results are more accurate than those recovered from gene expression data alone.
A New Syntactic Approach to Graphic Symbol Recognition
Authors: Y. Yu, W. Zhang, W. Liu
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents a novel syntactic symbol recognition approach to the vector based symbol recognition problem. Different from existing syntactic approaches, which usually describe the geometric relations among primitives, our method formulates a new model to describe the geometric information of a primitive with respect to the whole symbol object based on mathematical analysis. The mathematical model is theoretically rotation and scale invariant and experiments show its accuracy for vector based symbol recognition.
Engaging the audience in augmented reality performance
Authors: Caitilin de Bérigny Wall, Alistair Riddell
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

If digital media performance continues to evolve through the convergence of diverse technologies, where does this leave the audience with respect to the creative experience? Is it important for the artist to understand how the audience understood the use of technology in their work? Should the artist care? This paper discusses the relationship between artist and audience through an examination of an Augmented Reality Performance Project Edible Audience.
Methods of Testing Discrete Semiconductors in the 1149.4 Environment
Authors: Jari Hannu, Markku Moilanen
Venue: Journal of Electronic Testing: Theory and Applications (2007)

This paper describes measurement methods for testing discrete semiconductors in the environment defined by the IEEE 1149.4 standard for a mixed-signal bus. First, the paper introduces and illustrates measurement procedures for obtaining such essential electrical parameters of diodes and transistors as can be used for testing and identification. Then, the procedures are carried out and the achieved measurement results presented. To demonstrate the usability of the measurement procedures, the paper then presents test methods and measurement results for discrete component blocks. The results indicate that testing and measuring some of the electrical parameters of discrete semiconductors is possible in the 1149.4 environment. These parameters allow the determination of whether the component under test is working properly or not. Our tests only covered the semiconductors' DC features, disregarding their AC features. Also discussed are limitations of the 1149.4 environment in discrete semiconductor testing.
Mining Gene Expression Data Using Enhanced Intelligence Clustering Technique
Authors: B. Sathiyabhama, N. P. Gopalan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

With the advent of microarray technology, there is a growing need to reliably extract biologically significant information from massive gene expression data. Clustering is one of the key steps in analyzing gene expression data by identifying groups of genes that manifest similar expression patterns. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of proteomics. However, the large number of genes and their measurement complexity greatly increase the challenges of comprehension, interpretation and limited progress on cluster validation and identifying the number of clusters. In this paper, an intelligence based clustering algorithm is integrated with the validation techniques to assess the predictive power of the clusters. Through experimental evaluation, this approach is shown to outperform the other clustering methods greatly in terms of clustering quality, efficiency and automation. The resulting clusters offer potential insight into gene function, molecular biological processes and regulatory mechanisms.
Trade-offs in matching jobs and balancing load for distributed desktop grids
Authors: Jik-Soo Kim, Beomseok Nam, Peter Keleher, Michael Marsh, Bobby Bhattacharjee, Alan Sussman
Venue: Future Generation Computer Systems (2008)

Desktop grids can achieve tremendous computing power at low cost through opportunistic sharing of resources. However, traditional client-server Grid architectures do not deal with all types of failures, and do not always cope well with very dynamic environments. This paper describes the design of a desktop grid implemented over a modified Peer-to-Peer (P2P) architecture. The underlying P2P system is decentralized and inherently adaptable, giving the Grid robustness, scalability, and the ability to cope with dynamic environments, while still efficiently mapping application instances to available resources throughout the system. We use simulation to compare three different types of matching algorithms under differing workloads. Overall, the P2P approach produces significantly lower wait times than prior approaches, while adapting efficiently to the dynamic environment.
Optimizing marketing planning and budgeting using Markov decision processes: an airline case study
Authors: A. Labbi, C. Berrospi
Venue: IBM Journal of Research and Development (2007)

Many companies have no reliable way to determine whether their marketing money has been spent effectively, and their return on investment is often not evaluated in a systematic manner. Thus, a compelling need exists for computational tools that help companies to optimize their marketing strategies. For this purpose, we have developed computational models of customer buying behavior in order to determine and leverage the value generated by a customer within a given time frame. The term "customer value" refers to the revenue generated from a customer's buying behavior in relation to the costs of marketing campaigns. We describe a new tool, the IBM Customer Equity Lifetime Management Solution (CELM), that helps to determine long-term customer value by means of dynamic programming algorithms in order to identify which marketing actions are the most effective in improving customer loyalty and hence increasing revenue. Simulation of marketing scenarios may be performed in order to assess budget requirements and the expected impact of marketing policies. We present a case study of a pilot program with a leading European airline, and we show how this company optimized its frequent flyer program to reduce its marketing budget and increase customer value.
A Local Network Based on the UNIX Operating System
Authors: L. A. Rowe
Venue: IEEE Transactions on Software Engineering (1982)

The design and implementation of a local network operating ystem based on the UNIX1operating system is described. UNIX has been extended to allow existing programs to access remote resources with no source program changes. Programs may access remote files, have a remote working directory, execute remote programs, and communicate with remote processes using the standard UNIX interprocess communication mechanism (pipe's). An efficient message-oriented interprocess communication mechanism and asynchronous I/O were added to the system to support the development of distributed applications and to make it easier to connect the local network to packet-switched networks.
Tabular Expression-Based Testing Strategies: A Comparison
Authors: Xin Feng, David Lorge Parnas, T. H. Tse
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Tabular expressions were proposed as a documentation tool that can be used to document software precisely and unambiguously. This paper explores the applications of four testing strategies in tabular expression-based specifications and further compares the strategies on a mathematical basis.
A Mechanism with Penalty and Bonus in Grids
Authors: Duan-yang LIU, De-cai HUANG
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

An important challenge in grids is load balancing, and it includes problems about incentives and selfinterest. Mechanism Design (MD) provides a good solution to these two problems. And a truthful mechanism can force participants to tell their truth if they want to maximize their interest. But a truthful mechanism cannot restrict participants' behaviors in practice. In this paper, we extend mechanisms' definitions, introduce the penalty and bonus, formulate the penalty and bonus model with power functions, and quantify the value with the delay instead of the execution value. Moreover, we apply the model to a specific load-balancing problem, and change the original mechanism with verification into a new mechanism with penalty and bonus. At last we make a simulation study about this new mechanism and prove the effectiveness of the model.
Medium-access control protocols for WDM-based optical access networks with passive-star clusters interconnected by a backbone ring
Authors: Jayashree Ratnam, Ritesh Shyamsukha, Goutam Das, Satyanarayana Vuta, Amogh Joglekar, Debasish Datta
Venue: Computer Communications (2007)

This paper investigates the performance of medium access control (MAC) protocols in a wavelength-division multiplexing (WDM) based optical access network consisting of a backbone ring interconnecting several passive-star-based clusters of optical networking units (ONUs) at customer premises. Each cluster is connected to the backbone through an access node (AN). A scheduler located in each AN, executes two MAC protocols, one for the intracluster traffic and the other for the intercluster traffic. In order to maintain the quality of service, the scheduler in the AN employs, priority-based queuing for the intercluster traffic on pre-assigned wavelengths. For controlling the intracluster traffic, the scheduler employs pre-transmission coordination with ranging and look-ahead functionalities in the MAC protocol. The performance of MAC protocol for intracluster traffic is evaluated through event-driven simulation, while for intercluster traffic the MAC performance is evaluated through analytical modeling of the queuing system employing two dynamic bandwidth management schemes. Performance of the intracluster MAC protocol is shown to be improved by novel use of subcarrier multiplexing on the wavelength used for the control packet transmission. A comparative study of the two intercluster schemes in terms of end-to-end delay is carried out, to understand the effect of priority queuing on the real-time and non-real-time service packets.
Recognizing Humans Based on Gait Moment Image
Authors: Qinyong Ma, Shenkang Wang, Dongdong Nie, Jianfeng Qiu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

This paper utilizes the periodicity of swing distances to estimate gait period. It shows good adaptability to low quality silhouette images. Gait moment image (GMI) is implemented based on the estimated gait period. GMI is the gait probability image at each key moment in gait period. It reduces the noise of the silhouettes extracted from low quality videos by gait probability distribution at each key moment. Moment deviation image (MDI) is generated by using silhouette images and GMIs. As a good complement of gait energy image (GEI), MDI provides more motion features than the basic GEI. MDI is utilized together with GEI to represent a subject. The nearest neighbor classifier is adopted to recognize subjects. The proposed algorithm is evaluated on the USF gait database, and the performance is compared with the baseline algorithm and two other algorithms. Experimental results show that this algorithm achieves a higher total recognition rate than the other algorithms.
An Analysis of Some Commercial PL/I Programs
Authors: J. L. Elshoff
Venue: IEEE Transactions on Software Engineering (1976)

The source code for 120 production PL/I programs from several General Motors' commercial computing installations has been collected. The programs have been scanned both manually and automatically. Some data from the scanning process are presented and interpreted.
The Inclusion Variation of Non-additive Set Functions on T-Tribe
Authors: Chunqiao Tan, Qiang Zhang, Wangbin Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Inclusion variation on T-tribe play an important role in T-measures and fuzzy games theory, where they were used for additive set functions on T-tribe. In this paper classical variations theory is extended to non-additive set functions on T-tribe, after defining the inclusion variation, we investigate its some properties in detailed, such as, the (null-) null-additivity, exhaustivity, order continuity, continuity from the left and so on. As to the inclusion variation on T-tribe, an alternative proof of the Jordan decomposition theorem is given. Some relative results about inclusion variation in classical measure theory are generalized.
A study in play, pleasure and interaction design
Authors: Brigid Costello, Ernest Edmonds
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

This paper focuses on the design of pleasurably playful interfaces within an interactive art context. It describes the development of a framework of thirteen pleasures of play and outlines the application of this framework during the design process of three interactive artworks. These processes included both initial conceptual development stages and later user evaluation studies. The paper compares the artist's view of the pleasures that might be experienced in each work with the actual pleasures experienced by users during evaluation sessions. The results suggest that the pleasure framework is a useful tool to aid in the design of playful interfaces.
Timing Requirements for Time-Driven Systems Using Augmented Petri Nets
Authors: J. E. Coolahan
Venue: IEEE Transactions on Software Engineering (1983)

A methodology for the statement of timing requirements is presented for a class of embedded computer systems. The notion of a "time-driven" system is introduced which is formalized using a Petri net model augmented with timing information. Several subclasses of time-driven systems are defined with increasing levels of complexity. By deriving the conditions under which the Petri net model can be proven to be safe in the presence of time, timing requirements for modules in the system can be obtained. Analytical techniques are developed for proving safeness in the presence of time for the net constructions used in the defined subclasses of time-driven systems.