ppxscal/embedding_network huggingface dataset:
Scheduling Traffic Matrices On General Switch Fabrics
Authors: Xiang Wu, Amit Prakash, Marghoob Mohiyuddin, Adnan Aziz
Venue: Proceedings of the 14th IEEE Symposium on High-Performance Interconnects (2006)

A traffic matrix is an |S|×|T | matrixM, whereMij is a non-negative integer encoding the number of packets to be transferred from source i to sink j. Chang et al. [2] have shown how to efficiently compute an optimum schedule for transferring packets from sources to sinks when the sources and sinks are connected via a rearrangeable fabric such as crossbar. We address the same problem when the switch fabric is not rearrangeable. Specifically, we (1.) prove that the optimum scheduling problem is NP-hard for general switch fabrics, (2.) identify a sub-class of fabrics for which the problem is polynomial-time solvable, and (3.) develop a heuristic for the general case.
Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection
Authors: Jason Hickey, Aleksey Nogin, Xin Yu, Alexei Kopylov
Venue: ACM SIGPLAN Notices (2006)

We investigate the development of a general-purpose framework for mechanized reasoning about the meta-theory of programming languages. In order to provide a standard, uniform account of a programming language, we propose to define it as a logic in a logical framework, using the same mechanisms for definition, reasoning, and automation that are available to other logics. Then, in order to reason about the language's meta-theory, we use reflection to inject the programming language into (usually richer and more expressive) meta-theory.One of the key features of our approach is that structure of the language is preserved when it is reflected, including variables, meta-variables, and binding structure. This allows the structure of proofs to be preserved as well, and there is a one-to-one map from proof steps in the original programming logic to proof steps in the reflected logic. The act of reflecting a language is automated; all definitions, theorems, and proofs are preserved by the transformation and all the key lemmas (such as proof and structural induction) are automatically derived.The principal representation used by the reflected logic is higher-order abstract syntax (HOAS). However, reasoning about terms in HOAS can be awkward in some cases, especially for variables. For this reason, we define a computationally equivalent variable-free de Bruijn representation that is interchangeable with the HOAS in all contexts. The de Bruijn representation inherits the properties of substitution and alpha-equality from the logical framework, and it is not complicated by administrative issues like variable renumbering.We further develop the concepts and principles of proofs, provability, and structural and proof induction. This work is fully implemented in the MetaPRL theorem prover. We illustrate with an application to F<: as defined in the POPLmark challenge.
On Rule Induction Method Based Rough Sets in Diagnostic Expert System
Authors: LI Ai-Ping, Jia Yan, WU Quan-Yuan
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

It usually takes a long period to acquire plant disease knowledge using the traditional methods during the development of expert system. This paper describes relations between rough set theory and rulebased description of plant diseases, which corresponds to the process of knowledge acquisition of expert system. Then the exclusive rules, inclusive rules and disease images of rapeseed disease are built based on the PDES diagnosis model, and the definition of probability rule is put forward. At last, the paper presents the rule-based automated induction reasoning method, including exhaustive search, post-processing procedure, estimation for statistic test and the bootstrap and resampling methods. We also introduce automated induction of the rule-based description, which is used in our plant diseases diagnostic expert system. The experimental results show that rough set theory gives a very suitable framework to represent processes of uncertain knowledge extraction.
Improving Prony's estimator for multiple frequency estimation by a general method of parametric filtering
Authors: T. H. Li, B. Kedem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Prony's estimator is known to be inconsistent for frequency estimation. In an attempt to diminish this problem, Dragosevic and Stankovic (1989) coupled the least squares method of autoregressive (AR) estimation with an iterative filtering scheme using an all-pole filter. But the inconsistency still persists. It is shown that the method becomes consistent if an appropriately parametrized filter is employed. The all-pole filter in particular can be reparametrized so that it too satisfies the parametrization requirement and thus leads to consistent estimates. Experimental results show that the modified method has a higher resolution than the discrete Fourier transform (DFT) and that its overall performance is quite remarkable.
A New Method of Interactive Marker-Driven Free form Mesh Deformation
Authors: Difei Lu, Ying Zhang, Xiuzi Ye
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

In this paper, we propose a new scheme for markerdriven free form global mesh deformation without manually establishing a skeleton or freeform deformation domain beforehand. It allows a user to deform a given mesh interactively and intuitively. Firstly markers are placed at existing mesh vertices. Then user moves markers as constrained handles in a free form style. Next a global shape deformation is obtained by reconstructing the shape corresponding to the translated markers. Finally the system smooth the deformed mesh to get desired result. Our approach successfully conveys a sense of rigidity of the mesh, which is difficult in space-warp approaches. We demonstrate that our system can be used to intuitively deform a complex mesh with very little effort. We also show that our approach of the deformation provides a natural way to interpolate between key frames, allowing production of simple key framed animations.
Mobility Extensions for Knowledge Discovery Workflows in Data Mining Grids
Authors: Karin Anna Hummel, Georg Bohs, Peter Brezany, Ivan Janciak
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In scientific and other domains, knowledge discovery has started to be widely supported by service oriented Data Mining Grids. When access to such services is required anytime at anyplace, the integration of mobile devices and wireless networks into Grids is useful. However, mobile technologies exhibit limited capabilities and movement further causes frequent changes of context, like location and, thus, network connectivity. In this paper, the integration of mobile devices as ubiquitous knowledge discovery clients is proposed. The major service classes in knowledge discovery workflow management are addressed, that are, the monitoring and controlling of executing services. The feasibility of the approach is demonstrated by means of a .NET-based prototypical implementation on PDAs for the knowledge discovery framework GridMiner.
Efficient Bidding Strategies for Simultaneous Cliff-Edge Environments
Authors: Ron Katz, Sarit Kraus
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper proposes an efficient agent for competing in simultaneous substitutional Cliff-Edge (SCE) environments, which include simultaneous auctions and multiplayer Ultimatum-Games. The agent competes in one-shot interactions repeatedly, each time against different human opponents, and its performance is evaluated based on all the interactions in which it participates. It learns the general pattern of the population's behavior and does not apply any examples of previous interactions in the environment, neither of other competitors nor of its own. Moreover, the agent rapidly adjusts to environments comprising a large number of optional decisions at each decision point. We propose a generic approach which competes in different substitutional environments under the same configuration, with no knowledge about the specific rules of each environment. The underlying mechanism of the proposed agent is the Simultaneous Deviated Virtual Reinforcement Learning (SDVRL) algorithm, which is an extension of an algorithm for non-simultaneous environments. In addition, we propose a heuristic for improving our agent's complexity. Experiments comparing the average payoff of the proposed algorithm with other possible algorithms reveal a significant superiority of the former. In addition, our agent performs better than human competitors executing the same tasks.
Feature point correspondence between consecutive frames based on genetic algorithm
Authors: Y. Wang
Venue: International Journal of Robotics and Automation (2006)

This paper proposes a genetic algorithm-based approach to feature point correspondence between consecutive frames in a long image sequence containing outliers and occlusions. α-β-γ filter-based visual tracking is proposed to track the motion of feature points between the consecutive image frames according to the characteristics of high speed of image sampling and motion inertia. Then, the chromosome and the fitness function of the genetic algorithm are constructed based on factors such as tracking results of feature point, occlusion problem, outliers, and motion smoothness in image frames. Finally, the correspondence is obtained by using the genetic algorithm. Experimental results from a real image sequence demonstrate the effectiveness of the proposed approach for removing outliers and recovering occluded points.
Book Review: A Useful but Inadequate Introduction to Web Services
Authors: Marek Kowalkiewicz
Venue: IEEE Distributed Systems Online (2006)

A review of Building Web Services and .NET Applications by Lonnie Wall and Andrew Lader.
The information seeking behaviour of the users of digital scholarly journals
Authors: David Nicholas, Paul Huntington, Hamid R. Jamali, Anthony Watkinson
Venue: Information Processing and Management: an International Journal (2006)

The article employs deep log analysis (DLA) techniques, a more sophisticated form of transaction log analysis, to demonstrate what usage data can disclose about information seeking behaviour of virtual scholars - academics, and researchers. DLA works with the raw server log data, not the processed, pre-defined and selective data provided by journal publishers. It can generate types of analysis that are not generally available via proprietary web logging software because the software filters out relevant data and makes unhelpful assumptions about the meaning of the data. DLA also enables usage data to be associated with search/navigational and/or user demographic data, hence the name 'deep'. In this connection the usage of two digital journal libraries, those of Emerald Insight, and Blackwell Synergy are investigated. The information seeking behaviour of nearly three million users is analyzed in respect to the extent to which they penetrate the site, the number of visits made, as well as the type of items and content they view. The users are broken down by occupation, place of work, type of subscriber ("Big Deal", non-subscriber, etc.), geographical location, type of university (old and new), referrer link used, and number of items viewed in a session.
A price-based reliable routing game in wireless networks
Authors: Hua Liu, Bhaskar Krishnamachari
Venue: Proceeding from the 2006 workshop on Game theory for communications and networks (2006)

We investigate a price-based reliable routing game in a wireless network of selfish users. Each node is characterized by a probability of reliably forwarding a packet, and each link is characterized by a cost of transmission. The objective is to form a stable and reliable routing path between a given source and destination pair. The pricing mechanism involved in this routing game is destination-driven and source-mediated: for each successfully delivered packet, the destination node pays the source, which in turn compensates all nodes that participate in routing the packet. We develop a polynomial-time algorithm for deriving an efficient Nash equilibrium routing path. We also present simulations to evaluate the reliability of the obtained path with respect to prices and source-destination cooperation for different network settings.
Efficient Target Selection in Similarity Preserve Hash for Distributed Geographical Origin Identification System of Vegetables
Authors: Nobuyoshi Sato, Minoru Uehara, Koichiro Shimomura, Hirobumi Yamamoto, Kenichi Kamijo
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Recent years, especially in Japan, camouflaging geographical origin of agricultural products is a big problem. Therefore, we introduced a distributed system to identify their geographical origin using their differences of trace elements, or very small quantities of elements. Vegetables grown in farms absorb metals form the soil. Since compositions of trace metal elements differ from geographical places, this can be utilized to identify geographical origin of vegetables. In proposing system, trace element compositions of vegetables are measured when they are shipped from a farm, and the data is stored in databases which are located in farming districts. When a doubtful vegetable is found in food distribution channel, its trace element compositions are measured and compared by calculating correlation coefficients to ones accumulated in databases. This system can be used to verify geographical origin data by food traceability system. Because correlation coefficients are not known when they are once calculated, so correlation coefficients between all accumulated data in databases and doubtful vegetable. This means that proposing system is not scalable when the number of accumulated data is increased. Therefore, we introduced a method to reduce the number of target to calculate correlation coefficients using Similarity Preserve Hash (SPH) which gives similar output for similar input. This could reduce time to calculation itself, however, computation time including picking out target data for calculation of correlation coefficients from database. Therefore, we introduce a method to accelerate picking up data form database by grouping value of SPH.
Simplex Image Watermarking Resistant to RST Based on Radon Transform
Authors: Chun-e Zhang, Zhengding Qiu, Dongmei Sun
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A simplex watermarking on image resistant to RST (rotation, scale and translation) is proposed in this paper. It is a spatial watermarking algorithm on the condition of accurate self-registration geometrically, which insures watermark detection. To achieve the mentioned self-registration Radon transform is used. The watermarking detection is semi-blind. A novel correlation method is used in the detector. Theory and experiments demonstrate that the embedded watermarking survives many attacks especially for RST distortion.
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
Authors: Chung-Ming Lin, Yin Te Tsai, Chuan Yi Tang
Venue: Information Processing Letters (2006)

Both the building cost and the multiple-source routing cost are important considerations in construction of a network system. A spanning tree with minimum building cost among all spanning trees is called a minimum spanning tree (MST), and a spanning tree with minimum k-source routing cost among all spanning trees is called a k-source minimum routing cost spanning tree (k-MRCT). This paper proposes an algorithm to construct a spanning tree T for a metric graph G with a source vertex set S such that the building cost of T is at most 1 + 2/(α - 1) times of that of an MST of G, and the k-source routing cost of T is at most α(1+2(k-1)(n - 2)/k(n + k - 2)) times of that of a k-MRCT of G with respect to S, where α > 1, k = |S| and n is the number of vertices of G.
Media Company: An Empirical Analysis about the Mobile Channel
Authors: Cristina Catanzaro, Andrea Rangone, Filippo Maria Renga, Marta Valsecchi
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

Content and network digitalization and convergence have changed the media traditional value chain. New competition forms and distribution channels were exploited by media companies. In particular, the mobile became not only a new vehicle for consumer contents but also a new media. We conducted a research divided into three sections: Literature analysis: we investigated the most important critical factors that generate issues and evolutive trends: convergence, e-content, DRM. Consideration about the value chains of "traditional" media (television, paper magazines, radio), their latest digital evolution and the value chain of the mobile media. An empirical section presenting a methodological approach to investigate the presence and the positioning of traditional media companies in the mobile value chain and to understand the strategic opportunities created by the mobile for the media companies.
A Modeling Technique Applying an Object-Oriented Petri Net for Embedded System
Authors: Jaebong Lee, Misook Choi, Changoan Sung
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Embedded systems that mutually interact with physical space have properties such as time constraint, concurrency constraint, and the control of data/resource flow. The exceptional behaviors of the system that interact with physical space can result in critical damage and cause danger to the operation of an embedded system. Thus, in order to classify and express the exceptional behavior in the design phase, our study focuses on the expansion of Petri Net, which accommodates most of the embedded system's properties. The reliance of embedded systems can be increased by specifying the embedded system's exceptional behaviors.
Co-evolution of i* Models and 3APL Agents
Authors: Aneesh Krishna, Ying Guan, Aditya K. Ghose
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Agent-Oriented Conceptual Modelling (AOCM), as exemplified by the i* notation [9], represents an interesting approach to modelling early phase requirements that is particularly effective in capturing organisational contexts, stakeholder intentions and rationale. Our objective in this paper is to define means for executing i* models by translating these into set of interacting agents implemented in the 3APL language. We also propose a hybrid modelling, or co-evolution, approach in which i* models and 3APL agent programs are concurrently maintained and updated, while maintaining some modicum of loose coupling via consistency constraints. This paper explores how these two otherwise disparate approaches might be used in a synergistic fashion for requirement engineering.
Exploring sensor networks using mobile agents
Authors: Daniel Massaguer, Chien-Liang Fok, Nalini Venkatasubramanian, Gruia-Catalin Roman, Chenyang Lu
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Wireless sensor networks are often difficult to program and unable to adapt to a changing environment. Mobile agent middleware promises to address both concerns by providing higher-level programming abstractions and the ability to inject new agents into a preexisting network. The unique characteristics of wireless sensor networks like resource scarcity and emphasis on spatial locality require new algorithms for controlling agent behavior. This paper presents a procedure for one specific behavior: network exploration. Network exploration is needed by many tasks ranging from simple data collection to network health monitoring. Our proposed procedure uses a genetic algorithm to determine the number of agents and their itineraries, followed by techniques for in-network adaptation to unpredictable situations like node failure. This paper presents a genetic algorithm and its adaptation strategies. The procedure is evaluated using a wireless sensor network consisting of 25 Mica2 motes running Agilla, a mobile agent middleware for wireless sensor networks.
Time management in distributed factory simulation, a case study using HLA
Authors: Ke Wang, Sheng Xu, Leon F. McGinnis
Venue: Proceedings of the 37th conference on Winter simulation (2005)

DAistributed simulation is attractive for modeling large scale manufacturing systems. However, synchronization requirements present distinct challenges in designing and implementing a suitable modeling structure. Our experience in building a distributed simulation model for 300mm wafer fab using the High Level Architecture (HLA) shows that time management should be considered at both the design and the implementation stages. This paper proposes an optimistic-conservative synchronization scheme by using model specific information at the implementation stage. Computational results are then presented to show that properly implemented distributed factory simulation can achieve significant reduction in model execution time.
A Practical Method to Form Energy Efficient Connected -Coverage in Wireless Sensor Networks
Authors: Zhen Jiang, Robert Kline, Jie Wu, Fei Dai
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

In the wireless sensor networks, an important issue of area coverage is to know how many sensor nodes are needed in a deployment under a certain kind of distribution. In that way, the nodes can be dense enough to form a complete and connected cover of interest area. Another issue that needs to be addressed is the "redundancy of connectivity" caused by the use of the well known sufficient condition that "the communication range is at least twice the sensing range". In this paper, we show our result in solving these problems, a practical method to form a connected -coverage with a connected dominating set (CDS). By introducing a measure of node density called the biggest vacant square territory (BVST), we prove that the point coverage offered by a CDS implies area coverage of the area of interest. The 1-point-coverage of a CDS with a reduced R and a certain number of deploying sensors guarantees -area-coverage, or simply -coverage. Such assurance is verified via a simulation study on the CDS in [7] under random node distribution.
Experiences with Product Line Development of Embedded Systems at Testo AG
Authors: Ronny Kolb, Isabel John, Jens Knodel, Dirk Muthig, Uwe Haury, Gerald Meier
Venue: Proceedings of the 10th International on Software Product Line Conference (2006)

Product line practices are increasingly becoming popular in the domain of embedded software systems. This paper presents results of assessing success, consistency, and quality of Testo's product line of climate and flue gas measurement devices after its construction and the delivery of three commercial products. The results of the assessment showed that the incremental introduction of architecture-centric product line development can be considered successful even though there is no quantifiable reduction of timeto- market as well as development and maintenance costs so far. The success is mainly shown by the ability of Testo to develop more complex products and the satisfaction of the involved developers. A major issue encountered is ensuring the quality of reusable components and the conformance of the products to the architecture during development and maintenance.