ppxscal/embedding_network huggingface dataset:
A Model of Context Awareness Agent System Based on Dynamic Fuzzy Logic
Authors: Yu Zhang, Fanzhang Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

One of the main challenges of context-aware computing is how to elicit and represent complex, context-dependent requirements, and use the resulting representation within context-aware applications to support decision-making processes. In this paper, we describe context information with dynamic fuzzy logic and present an Agent-based context-aware system model. Unfortunately, there are often many errors that interfere in the Agent sensors, the process of each Agent communication and the sharing context information of each Agent. In order to robust the context awareness Agent system, we handle these errors with rewards mechanism, so that they do not interfere in the context information learning process. We consider an Agent decider that predicts stock price changes and uses its predictions for selecting actions. The simulation results demonstrate the validity and effectiveness of the proposed algorithm.
A survey on analytic studies of Delay-Tolerant Mobile Sensor Networks: Research Articles
Authors: Yu Wang, Ha Dang, Hongyi Wu
Venue: Wireless Communications Mobile Computing (2007)

This paper presents a survey of analytic studies on the Delay-Tolerant Mobile Sensor Network (DTMSN). We first give an overview of the analytic study on DTMSN, by identifying several key design components, that is, nodal mobility model, data delivery scheme, and queue management scheme. Then, several representative analytic models of DTMSN are exemplified and discussed in detail, with thorough comparison presented and possible open research issues enumerated. We expect that this paper will provide a deep understanding of the characteristics of DTMSN, and at the same time reveal the key design issues in its modeling and performance analysis, leading to useful insights for future theoretic study and protocol design. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A novel charge recycling design scheme based on adiabatic charge pump
Authors: Ka-Ming Keung, Vineela Manne, Akhilesh Tyagi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Power consumption has become a critical design criterion for integrated circuits given the growing importance of portable battery-operated devices. A typical CMOS gate driven by power supply (VDD) draws energy equal to CLVDD2 during every cycle of operation. We propose a new approach to recycle the charge with an adiabatic charge pump that moves the slower adiabatic components away from the critical path of logic. The critical path of the system, and hence the delay, do not change. This is achieved by overlapping the adiabatic charge pump delays with the computing path logic delays. Many embedded high performance applications such as digital signal processing (DSP), which exhibit datapath parallelism, are ideal candidates for this scheme. The proposed method has been implemented in DSP computations. SPICE simulations-based results indicate that the proposed scheme reduces energy consumption in these DSP circuits by as much as 18% (on average 9.94%) with no perceptible loss in performance. The area penalty for these energy savings are in the 1%-2% range, The leakage energy reduction in 45-nm BPTM averages 46 %.
An Analysis of 10-Gigabit Ethernet Protocol Stacks in Multicore Environments
Authors: G. Narayanaswamy, P. Balaji, W. Feng
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

This paper analyzes the interactions between the protocol stack (TCP/IP or iWARP over 10-Gigabit Ethernet) and its multicore environment. Specifically, for host-based protocols such as TCP/IP, we notice that a significant amount of processing is statically assigned to a single core, resulting in an imbalance of load on the different cores of the system and adversely impacting the performance of many applications. For host-offloaded protocols such as iWARP, on the other hand, the portions of the communication stack that are performed on the host, such as buffering of messages and memory copies, are closely tied with the associated process, and hence do not create such load imbalances. Thus, in this paper, we demonstrate that by intelligently mapping different processes of an application to specific cores, the imbalance created by the TCP/IP protocol stack can be largely countered and application performance significantly improved. At the same time, since the load is a better balanced in host-offloaded protocols such as iWARP, such mapping does not adversely affect their performance, thus keeping the mapping generic enough to be used with multiple protocol stacks.
Unified Messaging: Will It Finally Meet Its Promise?
Authors: Keri Schreiner
Venue: IT Professional (2007)

UM can enhance a company's ability to respond rapidly to customers, but adopting and implementing it can entail significant challenges.
Kyu-Young Whang speaks out: on academia and startups in Korea, probabilistic counting, main-memory query optimization, how to avoid being a hostage of pressure publishing, and more
Authors: Marianne Winslett
Venue: ACM SIGMOD Record (2007)

Welcome to this installment of ACM SIGMOD Record's series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we are at the ICDE 2007 Conference in Istanbul. I have here with me Kyu-Young Whang, who is a professor of computer science at Korea Advanced Institute of Science and Technology, and the director of the Advanced Information Technology Research Center. Before joining KAIST, Kyu-Young was a member of technical staff at IBM TJ Watson Research Center. His research interests are very broad, encompassing many different kinds of database systems as well as data mining and data streaming. He is an editor-in-chief of the VLDB Journal, a former member of the VLDB Endowment, and an IEEE Fellow. Kyu-Young's PhD is from Stanford. So, Kyu-Young, welcome!
The Oregon Report omputer Science and Computer Engineering Education in the 80's
Authors: U. W. Pooch
Venue: Computer (1978)

The computer's pervaiveness in the 1980's will demand even more professional talent, broader computer education, and perhaps even licensing of the computer professional. Industry, education, and professional groups must cooperate to meet these challenges.
The reevaluate statistical results of quality of life in patients with cerebrovascular disease using adaptive network-based fuzzy inference system
Authors: Mahmut Tokmakçı, Demet ínalan, Ferhan Soyuer, Ahmet Öztürk
Venue: Expert Systems with Applications: An International Journal (2008)

In this paper, the research data about quality of life in persons with cerebrovascular disease (CVD) is examined by Adaptive-Network-based Fuzzy Inference system (ANFIS) and these results are compared with statistical results obtained from the same data. The major parameters which are determined for quality of life levels are chosen as physical functions, social functions, and mental changing of the person. The aim of this study is to show that the expert based systems can be used to help the classic statistical computation systems on health and/or social problems.
A Symmetric Cosine Transform
Authors: H. Kitajima
Venue: IEEE Transactions on Computers (1980)

A new discrete cosine transform is developed in such a way that its closeness to the Karhunen-Loeve transform can be established straightforwardly. The transform is characterized by a symmetric matrix and will be referred to as the symmetric cosine transform (SCT). It is shown that a simple window on the data vector makes its covariance matrix more tractable for the SCT. Since the derivation of the SCT is, to some extent, similar to that of the fast KLT proposed by Jain, its advantages over the FKLT are discussed. The new transform is also compared with the conventional DCT proposed by Ahmed et al. The performance of the SCT is better than that of the DCT with respect to computational efficiency, the residual correlation, and the rate-distortion criterion. The SCT is also convenient in hardware implementation as both the forward and reverse operations can be handled by a single apparatus.
Estimation and econometric tests under price and output uncertainties
Authors: Moawia Alghalith
Venue: Applied Stochastic Models in Business and Industry (2007)

We extend the existing estimation methods to allow empirical estimation and hypothesis testing under simultaneous price and output uncertainty. Our approach modifies and expands the use of duality theory. Furthermore, our approach does not require the specification or estimation of the production&#x002F;cost function. In addition, our approach does not require the assumption of the statistical independence between price and output. Copyright &copy; 2007 John Wiley & Sons, Ltd.
The centre of area method as a basic mechanism for representation and navigation
Authors: J. R. Álvarez Sánchez, J. Mira Mira, F. de la Paz López, J. M. Cuadra Troncoso
Venue: Robotics and Autonomous Systems (2007)

Potential methods and all their gradient-based derivations are extensively used in autonomous robotics, primarily in association with reactive navigational strategies. In this article we introduce the fundamentals, formalisation and application of a brand-new method based on first-order moments called the ''centre of area method''. We also comment on its validity, at an individual level and in combination with other methods, in order to build a situated representation of the environment.
A Novel Approach for Process Planning Using Polychromatic Sets and Fuzzy Sets
Authors: Honghui Zhan, Xinyu Shao, Guojun Zhan, Haiping Zhu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Process planning is a task that determines the detailed manufacturing steps for transforming a raw material into a completed part, by utilizing the available machining resources. It involves multiple decision-making activities, such as operation-type selection, operation-method (machine, tool, and tool approach direction) selection, and operations sequencing. This study aims to developing an approach for process planning based on polychromatic sets and fuzzy sets. A complete flow and model is established for processing method seeking, processing route generation, and optimal route selection. The verification, grounding on a true model, is performed for the proposed model to prove the well practicability of this method.
A program logic for resources
Authors: David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano
Venue: Theoretical Computer Science (2007)

We introduce a reasoning infrastructure for proving statements about resource consumption in a fragment of the Java Virtual Machine Language (JVML). The infrastructure is based on a small hierarchy of program logics, with increasing levels of abstraction: at the top there is a type system for a high-level language that encodes resource consumption. The infrastructure is designed to be used in a proof-carrying code (PCC) scenario, where mobile programs can be equipped with formal evidence that they have predictable resource behaviour. This article focuses on the core logic in our infrastructure, a VDM-style program logic for partial correctness, which can make statements about resource consumption alongside functional behaviour. We establish some important results for this logic, including soundness and completeness with respect to a resource-aware operational semantics for the JVML. We also present a second logic built on top of the core logic, which is used to express termination; it too is shown to be sound and complete. We then outline how high-level language type systems may be connected to these logics. The entire infrastructure has been formalized in Isabelle/HOL, both to enhance the confidence in our meta-theoretical results, and to provide a prototype implementation for PCC. We give examples to show the usefulness of this approach, including proofs of resource bounds on code resulting from compiling high-level functional programs.
Pervasive 2007: It's about the User
Authors: Maria Vicente A. Bonto-Kane, Alvin Chin, Sheila Mc Carthy, Mayuree Srikulwong, Paul J. Timmins
Venue: IEEE Pervasive Computing (2007)

Pervasive computing is as much about the user as it is about the technology. So, the Fifth International Conference on Pervasive Computing emphasized desirability rather than just feasibility. Featured themes included user benefits, human-computer interaction, group and social interactions, context awareness, finding and positioning people and objects, and personal privacy.
A Neuromorphic aVLSI network chip with configurable plastic synapses
Authors: P. Camilleri, M. Giulioni, V. Dante, D. Badoni, G. Indiveri, B. Michaelis, J. Braun, P. del Giudice
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

We describe and demonstrate the key features of a neu- romorphic, analog VLSI chip (termed F-LANN) hosting 128 integrate-and-fire (IF) neurons with spike-frequency adap- tation, and 16 384 plastic bistable synapses implementing a self-regulated form of Hebbian, spike-driven, stochastic plasticity. We were successfully able to test and verify the basic operation of the chip as well as its main new fea- ture, namely the synaptic configurability. This configura- bility enables us to configure each individual synapse as either excitatory or inhibitory and to receive either recur- rent input from an on-chip neuron or AER (Address Event Representation)-based input from an off-chip neuron. It's also possible to set the initial state of each synapse as po- tentiated or depressed, and the state of each synapse can be read and stored on a computer. The main aim of this chip is to be able to efficiently perform associative learning ex- periments on a large number of synapses. In the future we would like to connect up multiple F-LANN chips together to be able to perform associative learning of natural stimulus sets.
Leveraging context in user-centric entity detection systems
Authors: Vadim von Brzeski, Utku Irmak, Reiner Kraft
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

A user-centric entity detection system is one in which the primary consumer of the detected entities is a person who can perform actions on the detected entities (e.g. perform a search, view a map, shop, etc.). We contrast this with machine-centric detection systems where the primary consumer of the detected entities is a machine. Machine-centric detection systems typically focus on the quantity of detected entities, measured by precision and recall metrics, with the goal of correctly identifying every single entity in a document. However, the simple precision/recall scores of machine-centric entity detection systems fail to accurately reflect the quality of detected entities in user-centric systems, where users may not necessarily want to "see" every possible entity. We posit that not all of the detected entities in a given piece of text are necessarily relevant to the main topic of the text, nor are they necessarily interesting enough to the user to warrant further action. In fact, presenting all of the detected entities to a user may annoy the user to the point where he decides to turn this capability off completely, an undesirable outcome. Therefore, we propose to measure the quality and utility of user-centric entity detection systems in three core dimensions: the accuracy, the interestingness, and the relevance of the entities it presents to the user. We show that leveraging surrounding context can greatly improve the performance of such systems in all three dimensions by employing novel algorithms for generating a concept vector and for finding concept extensions using search query logs. We extensively evaluate the proposed algorithms within Contextual Shortcuts - a large-scale user-centric entity detection platform - using 1,586 entities detected over 1,519 documents. The results confirm the importance of using context within user-centric entity detection systems, and validate the usefulness of the proposed algorithms by showing how they improve the overall entity detection quality within Contextual Shortcuts.
The resource oriented authorization manager (ROAM)
Authors: J. R. Burruss
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The resource oriented authorization manager (ROAM) was created to provide a simple but flexible authorization system for the National Fusion Grid (FusionGrid). This system builds on and extends previous community efforts by both responding to access authorization requests and by providing a Web interface/or resource management. ROAM works with the globus resource allocation manager (GRAM), and is general enough to be used by other virtual organizations that use Globus middleware or X.509/TLS authentication schemes to secure a grid of distributed resources. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Implicit hop-by-hop congestion control in wireless multihop networks
Authors: Björn Scheuermann, Christian Lochert, Martin Mauve
Venue: Ad Hoc Networks (2008)

It has been shown that TCP and TCP-like congestion control are highly problematic in wireless multihop networks. In this paper we present a novel hop-by-hop congestion control protocol that has been tailored to the specific properties of the shared medium. In the proposed scheme, backpressure towards the source node is established implicitly, by passively observing the medium. A lightweight error detection and correction mechanism guarantees a fast reaction to changing medium conditions and low overhead. Our approach is equally applicable to TCP- and UDP-like data streams. We demonstrate the performance of our approach by an in-depth simulation study. These findings are underlined by testbed results obtained using an implementation of our protocol on real hardware.
Protecting IP Multimedia Subsystem (IMS) Service Delivery Platform from Time Independent Attacks
Authors: Muhammad Sher, Thomas Magedanz
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

With the emergence of mobile multimedia services, such as unified messaging, click to dial, cross network multiparty conferencing and seamless multimedia streaming services, the fixed-mobile convergence and voice-data integration has started, leading to an overall Internet-Telecommunications merger. The IP Multimedia Subsystem (IMS) is considered as the next generation service delivery platform in this converge communication world. It consists of modular design with open interfaces and enables the flexibility for providing multimedia services over IP technology. At parallel this open based emerging technology has security challenges from multiple communication platforms like IP, SIP and RTP. In this article our objective is to develop security model to protect IMS Service Delivery Platform (SDP) from different time independent attacks e.g. SQL injection and media flow attacks. These attacks ultimately downfall the value added services. At the end we shall present the performance results at Fokus Fraunhofer Testbed to see the proposed solution for real world applications.
Designing mobility models based on social network theory
Authors: Mirco Musolesi, Cecilia Mascolo
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2007)

Validation of mobile ad hoc network protocols relies almost exclusively on simulation. The value of the validation is, therefore, highly dependent on how realistic the movement models used in the simulations are. Since there is a very limited number of available real traces in the public domain, synthetic models for movement pattern generation must be used. However, most widely used models are currently very simplistic, their focus being ease of implementation rather than soundness of foundation. Simulation results of protocols are often based on randomly generated movement patterns and, therefore, may differ considerably from those that can be obtained by deploying the system in real scenarios. Movement is strongly affected by the needs of humans to socialise or cooperate, in one form or another. Fortunately, humans are known to associate in particular ways that can be mathematically modelled and that have been studied in social sciences for years. In this paper we propose a new mobility model founded on social network theory. The model allows collections of hosts to be grouped together in a way that is based on social relationships among the individuals. This clustering is then mapped to a topographical space, with movements influenced by the strength of social ties that may also change in time. We have validated our model with real traces by showing that the synthetic mobility traces are a very good approximation of human movement patterns. The impact of the adoption of the proposed algorithm on the performance of AODV and DSR is also presented and discussed.
Compact visualisation of video summaries
Authors: Janko Ćalić, Neill W. Campbell
Venue: EURASIP Journal on Advances in Signal Processing (2007)

This paper presents a system for compact and intuitive video summarisation aimed at both high-end professional production environments and small-screen portable devices. To represent large amounts of information in the form of a video key-frame summary, this paper studies the narrative grammar of comics, and using its universal and intuitive rules, lays out visual summaries in an efficient and user-centered way. In addition, the system exploits visual attention modelling and rapid serial visual presentation to generate highly compact summaries on mobile devices. A robust real-time algorithm for key-frame extraction is presented. The system ranks importance of key-frame sizes in the final layout by balancing the dominant visual representability and discovery of unanticipated content utilising a specific cost function and an unsupervised robust spectral clustering technique. A final layout is created using an optimisation algorithm based on dynamic programming. Algorithm efficiency and robustness are demonstrated by comparing the results with a manually labelled ground truth and with optimal panelling solutions.
Extending XQuery with window functions
Authors: Irina Botan, Donald Kossmann, Peter M. Fischer, Tim Kraska, Dana Florescu, Rokas Tamosevicius
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

This paper presents two extensions for XQuery. The first extension allows the definition and processing of different kinds of windows over an input sequence; i.e., tumbling, sliding, and landmark windows. The second extension extends the XQuery data model (XDM) to support infinite sequences. This extension makes it possible to use XQuery as a language for continuous queries. Both extensions have been integrated into a Java-based open source XQuery engine. This paper gives details of this implementation and presents the results of running the Linear Road benchmark on the extended XQuery engine.