ppxscal/embedding_network huggingface dataset:
Zero servers with zero broadcasts
Authors: Miguel Castro, Greg O'Shea, Antony Rowstron
Venue: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking (2006)

To achieve the vision of networks that work without any supporting infrastructure, we need wireless ad hoc technology to replace the cabling infrastructure, but we also need self-configuring network and application services to replace the server infrastructure. Current solutions perform poorly because they either pick a single host to act as the server or they use network wide broadcasts to implement services. We need wireless ad hoc networks with zero servers and zero broadcasts!Can we use DHTs to build both network- and application-level services with zero servers and zero broadcasts? This paper starts to answer this question. It shows that it is important to remove broadcasts at all levels of the networking stack and describes how to use the Virtual Ring Routing protocol to achieve our vision.
Security Analysis of Hsieh-Sun's Deniable Authentication Protocol
Authors: Eun-Jun Yoon, Kee-Young Yoo
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

In 2004, Hsieh and Sun showed that Fan et al.'s deniable protocol does not posse the denial property; that is, a cheating receiver can prove the source of the received message to a third party. Furthermore, they also presented a modification of Fan et al.'s protocol to overcome the security flaw. However, the current paper points out an error in Hsieh-Sun's cryptanalysis on Fan et al.'s deniable authentication protocol and demonstrate that Hsieh-Sun's improved deniable authentication protocol still does not posse the deniable property and is susceptible to a malicious receiver's impersonation attack.
An Effect of Dopamine Depletion on Decision-making: The Temporal Coupling of Deliberation and Execution
Authors: Mathias Pessiglione, Virginie Czernecki, Bernard Pillon, Bruno Dubois, Michael Schüpbach, Yves Agid, Léon Tremblay
Venue: Journal of Cognitive Neuroscience (2005)

When a decision between alternative actions has to be made, the primate brain is able to uncouple motor execution from mental deliberation, providing time for higher cognitive processes such as remembering and reasoning. The mental deliberation leading to the decision and the motor execution applying the decision are likely to involve different neuronal circuits linking the basal ganglia and the frontal cortex. Behavioral and physiological studies in monkeys indicate that dopamine depletion may result in a loss of functional segregation between these circuits, hence, in interference between the deliberation and execution processes. To test this hypothesis in humans, we analyzed the movements of parkinsonian patients in a go/no-go task, contrasting periods of uncertainty with periods of knowledge about the rule to be applied. Two groups of patients were compared to healthy subjects: one group was treated with dopaminergic medication and the other with deep brain stimulation; both groups were also tested without any treatment. In healthy subjects, the movement time was unaffected by uncertainty. In untreated patients, the movement time increased with uncertainty, reflecting interference between deliberation and execution processes. This interference was fully corrected with dopaminergic medication but was unchanged with deep brain stimulation. Moreover, decision-related hesitations were detectable in the movements of dopamine-depleted patients, revealing a temporal coupling of deliberation and execution. We suggest that such coupling may be related to the loss of dopamine-mediated functional segregation between basal ganglia circuits processing different stages of goal-directed behavior.
Truncated Online Arithmetic with Applications to Communication Systems
Authors: Sridhar Rajagopal, Joseph R. Cavallaro
Venue: IEEE Transactions on Computers (2006)

Truncation in digit-precision is a very important and common operation in embedded system design for bounding the required finite precision and for area-time-power savings. In this paper, we present the use of online arithmetic to provide truncated computations with communication systems as one of the applications. In contrast to truncation in conventional arithmetic, online arithmetic can truncate dynamically and produce both area and time benefits due to the digit-serial nature of computations. This is of great advantage in communication systems where the precision requirements can change dynamically with the environment. While truncation in conventional arithmetic can have significant truncation errors, especially when the output precision is less than the input precision, the redundancy and most significant digit first nature of online arithmetic restricts the truncation error to only the least significant digit of the truncated result. As an application that uses significant truncation in precision, a code matched filter detector for wireless systems is designed using truncated online arithmetic. The detector can provide both hard decisions and soft(er) decisions dynamically as well as interface with other conventional arithmetic circuits or act as a DSP coprocessor. Thus, optimized communication receivers with coexisting conventional arithmetic for saturation and online arithmetic for truncation can now be built. The truncated online arithmetic detector was also verified with a VLSI implementation in an AMI 0.5 \mu MOSIS tiny chip process.
Enterprise Telesales Opportunity Pipelines Performance Management
Authors: Trieu C. Chieu, Pawan Chowdhary, Shiwa S. Fu, Florian Pinel, Jih-Shyr Yih
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Enterprise telesales is most different from consumer sales by having a prolonged sales cycle, in weeks or months, in order to integrate various internal supports to validate and satisfy complex client demands and needs. Managers of such telesales centers are often challenged by the elaborate tasks of tracking the subtle progress of these pipelines of sales opportunities. Thus, an on-demand dashboard for the managers as well as the telesales representatives is a critical IT tool to address this unique problem. This paper provides insights into the Business Performance Management (BPM), a technology used in business intelligence to enable users to observe, analyze, and act upon the information at the right time. To describe a sales cycle and the tracking needs, we start with a set of Key Performance Indicators (KPIs) for a staged pipeline progression model. Based on business rules and threshold conditions for these KPIs, sets of business situations and alerts are generated for presentation. Finally, a hierarchical design is explained with drilldown capabilities for a typical reporting structure of a telesales center. The productivity of an IBM telesales center under such proactive management has been found to be six to seven times more cost effective than traditional field sales.
A Method for XQuery Transform Implementation Based on Shadow Mechanism
Authors: Maria Rekouts, Maxim Grinev, Alexander Boldakov
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The XQuery Update Facility has been recently published by the World Wide Web Consortium as a working draft. Among other features, the working draft presents a novel powerful transform expression. A transform expression creates a new modified copy of an XML subtree, where the modifications are specified as update operations. In this paper we investigate the use of transform expressions and provide a method to support transform expressions efficiently: the method avoids copying of the whole modified XML subtree. Our method is based on the idea of shadow mechanism proposed in early work on recovery.
Safety guarantee of continuous join queries over punctuated data streams
Authors: Hua-Gang Li, Songting Chen, Junichi Tatemura, Divyakant Agrawal, K. Selçuk Candan, Wang-Pin Hsiung
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Continuous join queries (CJQ) are needed for correlating data from multiple streams. One fundamental problem for processing such queries is that since the data streams are infinite, this would require the join operator to store infinite states and eventually run out of space. Punctuation semantics has been proposed to specifically address this problem. In particular, punctuations explicitly mark the end of a subset of data and, hence, enable purging of the stored data which will not contribute to any new query results. Given a set of available punctuation schemes, if one can identify that a CJQ still requires unbounded storage, then this query can be flagged as unsafe and can be prevented from running. Unfortunately, while punctuation semantics is clearly useful, the mechanisms to identify if and how a particular CJQ could benefit from a given set of punctuation schemes are not yet known. In this paper, we provide sufficient and necessary conditions for checking whether a CJQ can be safely executed under a given set of punctuation schemes or not. In particular, we introduce a novel punctuation graph to aid the analysis of the safety for a given query. We show that the safety checking problem can be done in polynomial time based on this punctuation graph construct. In addition, various issues and challenges related to the safety checking of CJQs are highlighted.
A Functional Fault Model with Implicit Fault Effect Propagation Requirements
Authors: Irith Pomeranz, Srinivas Patil, Praveen K. Parvathala
Venue: Proceedings of the 15th Asian Test Symposium (2006)

We define a functional fault model that does not include explicit fault effect propagation requirements. Test generation for this functional fault model is done considering only a fault free circuit. This simplifies the functional test generation process. We demonstrate through experimental results that functional test sequences generated based on this model are effective in providing very high gate-level stuck-at fault coverage.
Robust adaptive beamforming via LMS-like target tracking
Authors: S. Affes, S. Gazor, Y. Grenier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper presents an algorithm implementing robustness in beamforming, by directly reducing localization errors in the presence of pointing errors or a single moving target. Given an initial position, the desired source signal is first estimated using a classical beamforming unit. It is in a second step, processed by an "LMS-like" gradient stochastic estimation procedure of the steering vector, to adaptively track the correct source position. The newly identified source position is projected over the array manifold, then finally transmitted in a feedback loop to the beamforming unit, closing in this way the global algorithm iteration. The simulation results show that robustness is effectively realized without any compromising output SNR loss. Moreover, they prove an efficient tracking behavior in the presence of mobile sources.
A Temporal Logic Characterisation of Oservational Determinism
Authors: Marieke Huisman, Pratik Worah, Kim Sunesen
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

This paper studies observational determinism, a generalisation of non-interference for multi-threaded programs. Standard notions of non-interference only consider input and output of programs, but to ensure the security of multithreaded programs, one has to consider execution traces. In earlier work, Zdancewic and Myers propose to consider a multi-threaded program secure when it behaves deterministic w.r.t. its public (or low) variables, i.e. traces of public variables should not depend on private (or high) variables. This property is called observational determinism. The original definition of observational determinism still allows to reveal private data; this paper corrects this. The main contribution of this paper is a rephrasing of the definition of observational determinism in terms of a temporal logic. This allows to use standard model checking techniques to verify observational determinism, which has the advantage that the verification is automatic and precise. Moreover in case the verification fails, model checking can produce a counterexample. We characterise observational determinism in CTL* and in the polyadic modal ì-calculus. For both logics, model checking algorithms exist.
New features in CPN-AMI 3: focusing on the analysis of complex distributed systems
Authors: A. Hamez, L. Hillah, F. Kordon, A. Linard, E. Paviot-Adet, X. Renault, Y. Thierry-Mieg
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

Due to the state-space size explosion problem, behavioral analysis techniques are difficult to scale up to industrial size problems. Our group couples research on analysis tools with an introspection on modeling and software engineering techniques. CPN-AMI is an integrated development and analysis environment dedicated to Petri nets. The numerous services it offers are built by a homogeneous integration of tools developed internally, and third-party tools from partner universities. These tools include state of the art algorithms and data-structures. This third major release offers better support for modeling and analysis of very large systems.
Flexsim Software Products Inc.
Authors: Roger Hullinger
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Features, functionality and power - what sets Flexsim apart. Everyone attending the Winter Simulation Conference knows what simulation is and what it does. Everyone attending also has an inkling of what they would like it to be, too. Flexsim's presentation will show how Flexsim is unique from other simulators in terms of its features, functionality and power. 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
Content-Based Positioning in Learning Networks
Authors: Jan van Bruggen, Ellen Rusman, Bas Giesbers, Rob Koper
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Positioning in learning networks is a process that assists learners in finding a starting point and an efficient route in the network that will foster their competence building. In order to avoid labor-intense routines in the network we explore computational approaches to services such as positioning that are based on the contents of the learning network and the behavior of those participating in it, rather than in predefined procedures and (meta-) data. We present a content-based approach to positioning that uses latent semantic analysis to compare learner portfolios to contents offered in the learning network. Initial results indicate the feasibility of the approach, but a number of important caveats are discussed.
LB HUST: A Symmetrical Boundary Distance for Clustering Time Series
Authors: Li Junkui, Wang Yuanzhen, Li Xinping
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Clustering is an important technology in mining time series, and the key is to define the similarity or dissimilarity between data.One of existing time series distance measures LB Keogh, is tighter lower bounding than Euclidean and Dynamic Time Warping (DTW), however, it is an asymmetrical distance measure, and has its limitation in clustering. To solve the problem, we present a symmetrical boundary distance measure called LB HUST, and prove that it is tighter lower bounding than LB Keogh.We apply LB HUST to cluster time series, and update the boundary of the cluster when a new time series is added into the cluster. The experiments show that the method exceeds the approaches based on Euclidean and DTW in terms of accuracy.
Semantic-driven Management and Search for Resources in Research Community
Authors: Junsheng Zhang, Zhixian Yan
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

In recent years, semantic search has become one hot motivation of the semantic web. In this paper, we propose a semantic-based resource management and search architecture and its implementation in research community, including most of the research relevant resources. We have built two authoring tools respectively for concepts and instances. With the authoring tools, semantic search portal is provided, which has three different interfaces, respectively for retrieval of concept , instance and semantic relationship. Compared with the traditional search methods, semantic search methodology not only gives us more interesting and satisfying search results, whose precision is higher than those of traditional ones only based on keywords, but also displays the results in a more structural and semantic way.
Preserved Recognition in a Case of Developmental Amnesia: Implications for the Acquisition of Semantic Memory?
Authors: Alan Baddeley, Faraneh Vargha-khadem, Mortimer Mishkin
Venue: Journal of Cognitive Neuroscience (2001)

We report the performance on recognition memory tests of Jon, who, despite amnesia from early childhood, has developed normal levels of performance on tests of intelligence, language, and general knowledge. Despite impaired recall, he performed within the normal range on each of six recognition tests, but he appears to lack the recollective phenomenological experience normally associated with episodic memory. His recall of previously unfamiliar newsreel events was impaired, but gained substantially from repetition over a 2-day period. Our results are consistent with the hypothesis that the recollective process of episodic memory is not necessary either for recognition or for the acquisition of semantic knowledge.
Models and Methods for Discovering Automatable Activity Segments in a Service-Oriented Environment
Authors: C. V. Ramamoorthy
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Although computers were invented in 1945, barely fifty years ago, their enormous value and impact on society has relegated much of computing discipline, fortunately or unfortunately, into a commodity status already. Not only are semiconductor-based computers inherently fast, the unique use of bootstrapping to use computers to design even faster computers has brought us to the precipitous edge of unprecedented computing performance and exceptionally powerful systems. As unintended consequences, while the pedagogical theories of computing have failed to keep pace with the rapid technological advances, of immense importance, a systematic approach to achieving reliable systems design despite complexity compounding on virtually daily basis, is sorely lacking. As a result, systems design is spinning out of control and urgently warrants a new approach to rein it in so that they may serve humanity in a safe and reliable manner. A quick analysis of the evolution of IBM Corporation is highly revealing of the challenges faced by the industry. IBM began its journey as a giant in computer hardware design including the legendary IBM 7044 and then quickly turned into a turn-key systems company with its proprietary operating system in the 1970s. By the late 1970s, the dawn of the VLSI age relegated computer hardware to the level of a commodity and IBM's desire to maintain a high profit margin forced it to turn to software as its core competency. The value of data and its manipulation became a dominant force in the marketplace and IBM emerged as a specialist in database-oriented products. Stiff competition from Oracle and other database vendors, and with the introduction of Microsoft's Access have steadily eroded IBM's cutting edge to the point where IBM is presently being forced to evolve into an entirely new company and a major player in the service industry.
Enhancing Interoperability via Generic Multimedia Syntax Translation
Authors: Joseph Thomas-Kerr, Ian Burnett, Christian Ritz
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The Bitstream Binding Language (BBL) is a new technology developed by the authors and being standardized by MPEG, which describes how multimedia content and metadata can be mapped onto streaming formats. This paper describes how BBL can be used to enhance the interoperability of multimedia content by providing a generic mechanism for the translation of content between formats. As new content formats are developed, BBL can be used to describe how to translate the content into a form that existing devices are able to render. This consequently simplifies the adoption of new multimedia content forms because existing devices are able to consume the content even though they do not understand its native format.
A core for ambient and mobile intelligent imaging applications
Authors: J. Jachalsky, M. Wahler, P. Pirsch
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper describes the work in progress of the European IST-2001-34410 CAMELLIA project, which focuses on a platform-based development of a smart imaging core to be embedded in smart cameras. Therefore the work within the CAMELLIA project comprises the specification and implementation of smart imaging applications including the development of required new algorithms and hardware. Based on an existing video encoding architecture for MPEG-4 Simple Profile, the aim is to design a smart imaging core, which is suitable for automotive and mobile communication applications. Thereby the encoding architecture is to be extended with processing units for low- and mid-level smart imaging functions. To indicate the applicability of this platform-based development, a first approach for a motion estimation based background detection using a hardware motion estimation unit is illustrated in this paper. Furthermore, first results employing the background detection to detect moving objects in video sequences using a functional simulator of a video encoding architecture are presented.
An Efficient Parallel Retrieval for Complex Object Index
Authors: Takeshi Horie, Takuya Ukon, Tatsuo Tsuji, Ken Higuchi
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

By splitting a large index of complex objects into subsets and placing each of them on a separate machine, retrieval throughput would be improved invoking parallelism. We employ the multiindexing technique which exhibits good adaptability to index splitting. In this paper, we propose a parallel index retrieval scheme in which objects in output packets are integrated in order to increase the packet density. New retrieval termination detection algorithms are incorporated to adapt the packet integration.