ppxscal/embedding_network huggingface dataset:
Exploiting Indifference for Customization of Partial Order Skylines
Authors: Wolf-Tilo Balke, Ulrich Guntzer, Wolf Siberski
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

Unlike numerical preferences, preferences on at-tribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by the user. In such orders many ob-ject values are incomparable, hence skylines sizes become unpractical. However, the Pareto semantics can be modified to benefit from indifferences: skyline result sizes can be essentially reduced by allowing the user to declare some incomparable values as equally desirable. A major problem of adding such equiva-lences is that they may result in intransitivity of the aggregated Pareto order and thus efficient query proc-essing is hampered. In this paper we analyze how far the strict Pareto semantics can be relaxed while al-ways retaining transitivity of the induced Pareto ag-gregation. Extensive practical tests show that skyline sizes can indeed be reduced about two orders of mag-nitude when using the maximum possible relaxation still guaranteeing the consistency with all user prefer-ences.
Towards Context-Based Flow Classification
Authors: Roel Ocampo, Alex Galis, Chris Todd, Hermann De Meer
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

An essential functionality for context-aware networks would be the ability to classify traffic into logical flows and to determine the characteristics of these flows, for various purposes such as QoS provisioning, traffic limiting and shaping, security filtering and access control, policy-based routing, adaptation, service triggering, and long-term network monitoring and management. In this paper we explore a multi-dimensional scheme of classifying flows based on both their intrinsic characteristics and on some relevant external factors, that is, we classify flows based on their context. We demonstrate the use of ontologies to formally model flow context for software design purposes and as a vocabulary for runtime context exchange and processing, and describe the implementation of a system that demonstrates contextbased flow classification.
An approach to design and development of decentralized data fusion simulator
Authors: Chandresh Mehta, Govindarajan Srimathveeravalli, Thenkurussi Kesavadas
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper discusses the ongoing efforts on development of a Decentralized Data Fusion (DDF) simulator for analysis and design of a distributed fusion-based tracking system. We have identified the requirements for a DDF simulator and have developed a fully interactive, graphical user interface based scenario generation tool called SceneGen (Srimathveeravalli, Subramanian and Kesavadas 2004) for creating battlefield scenarios, and a simulation tool called VizSim for running various DDF algorithms on scenarios created in SceneGen and displaying the simulation results in an easy to understand fashion. SceneGen and VizSim has been designed with a full compliment of user utilities, including an efficient terrain database generation module, a sensor report generation module and the database connectivity to store and retrieve scenarios and simulation results. The innovative visualization techniques used in the simulator helps in displaying the data in a fashion that transfers maximum information to a user. Both SceneGen and VizSim have been tested successfully for running scenarios consisting of a large number of entities.
Time Course of Processes and Representations Supporting Visual Object Identification and Memory
Authors: Haline E. Schendan, Marta Kutas
Venue: Journal of Cognitive Neuroscience (2003)

Event-related potentials (ERPs) were used to delineate the time course of activation of the processes and representations supporting visual object identification and memory. Following K. Srinivas (1993), 66 young people named objects in canonical or unusual views during study and an indirect memory test. Test views were the same or different from those at study. The first ERP repetition effect and earliest ERP format effect started at ~150 msec. Multiple ERP repetition effects appeared over time. All but the latest ones were largest for same views, although other aspects of their form specificity varied. Initial ERP format effects support multiple-views-plus-transformation accounts of identification and indicate the timing of processes of object model selection (frontal N350 from 148&ndash;250 to 500&ndash;700 msec) and view transformation via mental rotation (posterior N400/P600 from 250&ndash;356 to 700 msec). Thereafter, a late slow wave reflects a memory process more strongly recruited by different than same views. Overall, the ERP data demonstrate the activation of multiple memory processes over time during an indirect test, with earlier ones (within 148&ndash;400 msec) characterized by a pattern of form specificity consistent with the specific identification-related neural process or representational system supporting each memory function.
Synchronization domains in arrays of chaotic homoclinic systems
Authors: F. T. Arecchi, E. Allaria, I. Leyva, Boccaletti S
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

With reference to experiments on a CO/sub 2/ laser with feedback, we summarize the main features of chaotic orbits homoclinic to a saddle focus, and then face the problem of an array of coupled identical systems of this kind. We first investigate the dynamics of a closed chain of unidirectionally coupled oscillators in a regime of homoclinic chaos. The emerging synchronization regimes show analogies with the experimental behavior of a single chaotic laser self synchronized by a delayed feedback. Then we explore the response of an open chain of bidirectionally coupled chaotic homoclinic systems to external periodic stimuli. When one end of the chain is driven by a periodic signal, the system propagates a phase synchronization state in a certain range of coupling strengths and external frequencies. When two simultaneous forcings are applied at different points of the array, a rich phenomenology of stable competitive states is observed, including temporal alternation and spatial coexistence synchronization domains.
Design of microwave structures with MEFISTO-3D NOVA and MATLAB optimization and neural network toolboxes: Research Articles
Authors: Hong-Son Chu, Poman P. M. So, Wolfgang J. R. Hoefer
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

This paper introduces two time-domain field-based optimization procedures for microwave engineering. The methods are built on the foundations of MATLAB's optimization and neural network toolboxes. The first procedure makes use of a direct connection linking MATLAB's optimization toolbox with MEFISTO-3D NOVA. In this approach the field simulator acts as an objective function server for the optimization toolbox; these two programs work cooperatively with each other to tune the structure parameters to obtain a target response. The second procedure is an indirect optimization approach that makes use of MATLAB's neural network toolbox in conjunction with MEFISTO-3D NOVA to create a neural network model to emulate the structure of interest; the resulting neural network model is then used an objective function server in a normal MATLAB optimization process. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Flexible digital authentication techniques
Authors: Stephen R. Tate
Venue:  (2006)

This dissertation investigates authentication techniques in some emerging areas. Specifically, authentication schemes have been proposed that are well-suited for embedded systems, and privacy-respecting pay Web sites. With embedded systems, a person could own several devices which are capable of communication and interaction, but these devices use embedded processors whose computational capabilities are limited as compared to desktop computers. Examples of this scenario include entertainment devices or appliances owned by a consumer, multiple control and sensor systems in an automobile or airplane, and environmental controls in a building. An efficient public key cryptosystem has been devised, which provides a complete solution to an embedded system, including protocols for authentication, authenticated key exchange, encryption, and revocation. The new construction is especially suitable for the devices with constrained computing capabilities and resources. Compared with other available authentication schemes, such as X.509, identity-based encryption, etc., the new construction provides unique features such as simplicity, efficiency, forward secrecy, and an efficient re-keying mechanism. In the application scenario for a pay Web site, users may be sensitive about their privacy, and do not wish their behaviors to be tracked by Web sites. Thus, an anonymous authentication scheme is desirable in this case. That is, a user can prove his/her authenticity without revealing his/her identity. On the other hand, the Web site owner would like to prevent a bunch of users from sharing a single subscription while hiding behind user anonymity. The Web site should be able to detect these possible malicious behaviors, and exclude corrupted users from future service. This dissertation extensively discusses anonymous authentication techniques, such as group signature, direct anonymous attestation, and traceable signature. Three anonymous authentication schemes have been proposed, which include a group signature scheme with signature claiming and variable linkability, a scheme for direct anonymous attestation in trusted computing platforms with sign and verify protocols nearly seven times more efficient than the current solution, and a state-of-the-art traceable signature scheme with support for variable anonymity. These three schemes greatly advance research in the area of anonymous authentication. The authentication techniques presented in this dissertation are based on common mathematical and cryptographical foundations, sharing similar security assumptions. We call them flexible digital authentication schemes.
Virtual XML: a toolbox and use cases for the XML world view
Authors: K. H. Rose, S. Malaika, R. J. Schloss
Venue: IBM Systems Journal (2006)

Although the Extensible Markup Language (XML) has gained in popularity and has resulted in the creation of powerful software for authoring, transforming, and querying XML-based business data, much information remains in non-XML form. In this paper we introduce an approach to virtualize data resources and thus enable applications to access both XML and non-XML sources. We describe the architectural components that enable virtual XML-a toolbox that includes a cursor model, an XML-view mechanism such as the view created with the Data Format Description Language (DFDL), and XML processing languages. We illustrate the applicability of virtual XML through a number of use cases in various environments. We discuss the products that we expect from vendors and the open-source community and the way enterprises can plan to take advantage of virtual XML developments. Finally, we outline future research directions that include a vision of virtual XML that covers large-scale structures such as entire file systems, databases, or even the World Wide Web.
Discriminative Object Class Models of Appearance and Shape by Correlatons
Authors: S. Savarese, J. Winn, A. Criminisi
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper presents a new model of object classes which incorporates appearance and shape information jointly. Modeling objects appearance by distributions of visual words has recently proven successful. Here appearancebased models are augmented by capturing the spatial arrangement of visual words. Compact spatial modeling without loss of discrimination is achieved through the introduction of adaptive vector quantized correlograms, which we call correlatons. Efficiency is further improved by means of integral images. The robustness of our new models to geometric transformations, severe occlusions and missing information is also demonstrated. The accuracy of discrimination of the proposed models is assessed with respect to existing databases with large numbers of object classes viewed under general conditions, and shown to outperform appearance-only models.
Process Computing of Complaint Service Management in Reverse Logistics
Authors: Yi He, Zhixue Liu
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Nowadays, the significance of reverse logistics (RL) has been regarded by more and more enterprises increasingly. The complaint service management in reverse logistics (CSMRL) is an important content for reverse logistics strategy. Along with the rapid development of art and science, it is necessary and required to enable these advanced technologies to help CSMRL perform more efficiently and effectively. In this paper we take into consideration the process computing of CSMRL. The process of CSMRL includes three parts of collection, evaluation and disposal. Based on the computer telephone integration technology an integration multi-channels collection route-way can be designed; the evaluation of complaint and production is supported by intelligent decision support system; in accord with the different disposal countermeasures, the CSMRL processing system is established to implement corresponding disposal. As mentioned of the paper at last, the research on the process computing of CSMRL will be significant for business service computing in the future.
On State Synchronization of Business Conversations
Authors: Carlos Molina-Jimenez, Santosh Shrivastava, Simon Woodman
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

The paper assumes that business interactions between trading partners are composed of well defined conversations (tasks), such as issue a purchase order, process payment, refund money, cancel purchase order, etc. Using RosettaNet Partner Interface Processes (PIPs) as an example of these conversations, the paper discusses a method that guarantees that trading partners have a mutually consistent view of the state of business interactions despite encountering software and hardware related problems (e.g., clock skews, unpredictable transmission delays, message loss etc.). The paper develops centralized as well as distributed execution models and outlines the middleware functionality required for maintaining consistency.
Heuristic Algorithms for Efficient Wireless Multimedia Network Design
Authors: Vasilios Pasias, Dimitrios A. Karras, R. C. Papademetriou
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

This paper presents two novel heuristic algorithms for the design of wireless access multimedia networks. Emphasis was given to the design of CDMA based wireless multimedia networks and Fixed Wireless multimedia networks. The objectives of these methods are first to place a number of access points/base stations in a number of candidate sites and then to assign a number of fixed wireless terminals to the selected access points/base stations. Both methods are based on Graph Theory and they are essentially greedy algorithms. Except from capacity constraints, wireless reception characteristics are also considered. The algorithms are capable of designing medium and large-scale networks at polynomial time. Both algorithms were compared with an analogous optimisation problem through a series of tests. The results indicate that as regards design costs the performance of the heuristics is very close to this of the equivalent optimisation problem. The solution times for the heuristics are smaller especially when the number of the candidate access points/base stations becomes large.
A modified space frequency decomposition algorithm for visual motion
Authors: Ye Lu, Cheng Lu, Ze-Nian Li
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we present a method to decompose visual motion represented by computed optical flow using an over-complete dictionary of space frequency atoms. This is accomplished by a modified matching pursuit procedure which successively selects space and frequency localized atoms from this dictionary. In effect, this decomposition reveals the structure of optical flow field such that areas with motion at different spatial location and scale are identified. In addition, our method maintains the original resolution of the image when performing the decomposition at each scale. This minimizes the amount of the information lost in the decomposition process. We perform experiments using both synthetic and real image data sets to demonstrate the effectiveness of the proposed method.
Service Discovery Protocol in Wireless Sensor Networks
Authors: Xin-lian Zhou, Min Wu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Sensor network is a novel technology about acquiring and processing information. This paper introduces the basic interaction patterns between requesters and providers of services during a typical Service Discovery task. It discusses existing service discovery protocols and provides a preliminary analysis of the mechanisms for service and resource discovery in the Wireless Sensor Network domain.
Stub Libraries for Software Migration and Development
Authors: Pradeep Varma
Venue: Proceedings of the 13th IEEE International Workshop on Software Technology and Engineering Practice (2005)

We propose novel tool support for increasing testability of software systems. The support comprises stub software libraries for testing programs on platforms on which regular libraries may not be available. This can be encountered during outsourced software development (libraries unavailable to outsourcing provider), and development/migration in advance of vendor-provided libraries. Briefly, a stub library comprises a cached front-end component (including package headers) for integrating with the client program in standard fashion, with calls to the library either being served by locallycached answers in the front-end, or by remote invocations of a back-end on a platform supporting a live image of the library (if available). The ability to cache library request-response pairs implies the method can be used to inventory usage of libraries as a part of the standard inventory process in an outsourced porting/migration/development engagement. We discuss the compile-time and run-time issues raised by the tool support and the solutions we provide for them.
Knowledge Discovery of Traffic/People Behaviors Based on Image Mining Approach
Authors: Fatemeh Safara, Amir-Masud Eftekhari-Moghadam
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

The increasing number of image archives has made image mining an important task because of its potential to discover useful image patterns and relationships from a large set of images. We proposed a framework for extracting knowledge from a sequence of images [1]. The structure of the framework composed of two modules: image analysis and knowledge processing. In this paper, we customized the knowledge-processing module for checking normality/abnormality of vehicles/people behaviors in each image sequence.
Bound on the Operational Lifetime of Ultra Wide Band Sensor Network
Authors: Juan Xu, Yongfa Hong, Lin Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The operational lifetime is a critical parameter for time hopping ultra wide band (TH-UWB) wireless sensor networks..which is defined as the maximum number of times the task of delivering certain data to the sink node can be repeated before some sensor node runs out of energy under an initial energy at each sensor node is given. With n identical randomly located sensor nodes on a disk of area S and each node transmitting R bits data packet to the sink node, the formula for upper bound on the operation lifetime of TH-UWB wireless sensor network is derived. This formula indicates that the upper bound on the operational lifetime is in proportion to the (..-1)/2 order of the node density n/S. Thus, large-scale dense TH-UWB wireless sensor network is preferable.
TViews: An Extensible Architecture for Multiuser Digital Media Tables
Authors: Ali Mazalek, Matthew Reynolds, Glorianna Davenport
Venue: IEEE Computer Graphics and Applications (2006)

TViews is an extensible method and acoustic-based sensing framework for creating digital media tables that overcome many limitations of single-purpose systems. The system provides a means for real-time multiobject tracking on the tabletop and for the management of large numbers of objects and applications across multiple platform instances.
Instantaneous 'anything'
Authors: L. Cohen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The author presents a generalization of the concepts of instantaneous frequency and group delay. A simple formula is given for obtaining the instantaneous value of any quantity. The physical interpretation which emerges from these considerations is discussed. Examples are given using time, frequency and scale.
A novel method for automatic strategy acquisition in N-player non-zero-sum games
Authors: S. Phelps, M. Marcinkiewicz, S. Parsons
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. Previous studies in this domain have used standard co-evolutionary algorithms, often with the goal of searching for the "best" trading strategy. However, we argue that such algorithms are often ineffective for this type of game because they fail to embody an appropriate game-theoretic solution-concept, and it is unclear, what, if anything, they are optimizing. In this paper, we adopt a more appropriate criterion for success from evolutionary game-theory based on the likely adoption-rate of a given strategy in a large population of traders, and accordingly we are able to demonstrate that our evolved strategy performs well.