ppxscal/embedding_network huggingface dataset:
Secure Distributed Dossier Management in the Legal Domain
Authors: Martijn Warnier, Frances Brazier, Martin Apistola, Anja Oskamp
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The use of digital dossiers in Courts of Law, although currently in the phase of study, will be common practice in the future. This paper introduces the notion of distributed digital dossiers supported by a multi-agent system architecture, developed in interaction with the Courts of Amsterdam and Rotterdam. Management of such dossiers is core to the approach: consistency, completeness, integrity and security key concepts.
Rewrite-Based Satisfiability Procedures for Recursive Data Structures
Authors: Maria Paola Bonacina, Mnacho Echenim
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

If a rewrite-based inference system is guaranteed to terminate on the axioms of a theory T and any set of ground literals, then any theorem-proving strategy based on that inference system is a rewrite-based decision procedure for T-satisfiability. In this paper, we consider the class of theories defining recursive data structures, that might appear out of reach for this approach, because they are defined by an infinite set of axioms. We overcome this obstacle by designing a problem reduction that allows us to prove a general termination result for all these theories. We also show that the theorem-proving strategy decides satisfiability problems in any combination of these theories with other theories decided by the rewrite-based approach.
DSP systems for next-generation mobile wireless infrastructure
Authors: M. Bickerstaff
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Cellular mobile systems are evolving to offer enhanced packet data services at increased data rates. Emerging standards like GPRS, EDGE, UMTS and CDMA2000 promise high-speed Internet access and multimedia applications on an anywhere, anytime basis. Whereas most research efforts focus on portable handsets, this paper discusses the implications of these standards on the design of next-generation mobile infrastructure systems. Basestations (BTS) will require flexible, low cost integrated solutions that are capable of supporting several-standards. Software radio architectures will see increased deployment in these systems and this paper describes DSP-only and hybrid DSP+IP Core approaches. We argue that the implementation efficiency of the Viterbi algorithm and the SOVA and LOG-MAP variants will become a differentiating factor for next-generation wireless communications-particularly in those employing programmable DSP devices.
Teaching embedded computer systems with a Windows-based simulator
Authors: C. E. Wick
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The Systems Engineering Department at the US Naval Academy provides a set of courses that are designed to introduce modern practices in digital control to undergraduates majoring in systems engineering. A very important element of digital control to be taught is the use of microcontrollers as "embedded" elements in feedback control systems. A good simulation of a real microcontroller can be immensely helpful to demonstrate concepts and to give students some practical experience using embedded processors in a variety of applications. Finding no suitable embedded computer simulator for our undergraduate students, we proceeded to develop and use a Windows based simulation of the PIC16C54/57/71/84 RISC microprocessor family. The program contains a program editor, an assembler, debugging tools, graphical representation for all registers, tools to present signals on device pins, and many other features that are all integrated together in a Windows environment. The paper describes the simulation and discusses our experiences while using the simulation over a period of two semesters in an introductory microcontroller class. 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
Process-Oriented Knowledge Support in a Clinical Research Setting
Authors: Sascha Muller, Stefan Jablonski
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

This paper presents a model driven development method that provides integral support for knowledge intensive processes in clinical applications. The method is based on process models, which are capable to support knowledge intensive processes. The necessary modeling artifacts are created and afterwards integrated in the deployed process modeling method, using our model driven development approach. These so called process associated knowledge rules allow for the context sensitive knowledge retrieval during process execution.
An Effective Application-Level QoS Routing Scheme for MANETs
Authors: Toshiaki Osada, Gen Kitagata, Debasish Chakraborty, Takuo Suganuma, Norio Shiratori
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

In this research, our aim is to construct an effective quality of service (QoS) routing scheme for mobile ad hoc networks (MANET) that provides the service to satisfy required quality by absorbing dynamic changes of network resources. In this paper, we propose an Application-level QoS Routing Scheme for MANETs (ALRS) as a novel QoS routing, that includes following three significant features: (1) estimation of consumed bandwidth on each node using 2-hop neighbors' traffic information, (2) route construction combined with admission control on each application session using (1), and (3) route maintenance based on (1) and (2). ALRS realizes control of generated traffic in MANET effectively and enables to provide the service to satisfy required quality for dynamic changes of network resources. By using our proposed scheme, it is expected that the availability of bandwidth will be greatly improve for high-load communication, such as multimedia application on MANET. From our simulation results, it has shown, that our proposed scheme, by effective suppression of traffic, increased delivery ratio up to 40%, without any deterioration of throughput compared to traditional method. Results shows that our proposed scheme enables to provide the service to satisfy the required quality.
Modeling the effect of a nearby boundary on the HRTF
Authors: N. A. Gumerov
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Understanding and simplified modeling of the head related transfer function (HRTF) holds the key to many applications in spatial audio. We develop an analytical solution to the problem of scattering of sound from a sphere in the vicinity of an infinite plane. Using this solution we study the influence of a nearby scattering rigid surface, on a spherical model for the HRTF.
Improvements of preconditioned AOR iterative method for L-matrices
Authors: Yao-tang Li, Cui-xia Li, Shi-liang Wu
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we improve the preconditioned AOR method of linear systems considered by Evans et al. [The AOR iterative method for new preconditioned linear systems, Comput. Appl. Math. 132 (2001) 461-466]. In Evans' paper, the coefficient matrix of linear system have to be an L-matrix with a"i","i"+"1a"i"+"1","i>0, i=1,...,n-1 and 0
A Simple Statistical Algorithm for Biological Sequence Compression
Authors: Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris Mears
Venue: Proceedings of the 2007 Data Compression Conference (2007)

This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is maintained to estimate the probability distribution of the next symbol in the sequence to be encoded. Expert probabilities are combined to obtain the final distribution. The resulting information sequence provides insight for further study of the biological sequence. Each symbol is then encoded by arithmetic coding. Experiments show that our algorithm outperforms existing compressors on typical DNA and protein sequence datasets while maintaining a practical running time.
Improving Communication in E-democracy Using Natural Language Processing
Authors: Michele Carenini, Angus Whyte, Lorenzo Bertorello, Massimo Vanocchi
Venue: IEEE Intelligent Systems (2007)

The e-Democracy European Network (EDEN) sought to apply natural language processing technologies in e-democracy. EDEN improved communication between public administrations and citizens by improving information access and helping citizens make informed decisions. The main focus, however, was on using a particular NLP approach (Augmented Phrase Structure Grammar) and the factors that helped and hindered its rapid deployment in an e-democracy environment. Although the linguistic resources were highly reusable, EDEN had difficulty building a shared understanding of what NLP could and should accomplish to meet the project's aims. Even when the partners acutely recognized the need for such mutual understanding, the lack of it led to delays and jeopardized project success.
The importance of using domain knowledge in solving information distillation problems
Authors: Eduard Hovy
Venue:  (2006)

This thesis is an inquiry into the importance of incorporating domain knowledge into emerging information distillation tasks which are in principle similar to that of text summarization, but in practice require techniques that are not adequately addressed in previous work. Tasks being analyzed are headline generation, biography creation, online discussion summarization, and automatic evaluation for summaries. This thesis shows empirically that while traditional text summarization techniques are designed for generic summarization tasks, they cannot be readily applied to the above four tasks. Each task requires prior knowledge on the operating domain, data type, task structure, and output structure. Techniques and algorithms designed with this knowledge perform significantly better than the ones without. This thesis explores the solutions to headline generation, or the generation of summaries of very short length. By identifying features that are specific to headlines, a keyword selection model was designed to select words that are headline-worthy. Context information surrounding these headline words are extracted to produce phrase-based headlines. Typical question-answering systems target definition questions and produce factoid answers. However, when questions require complex answers, like "who is x" questions, a biography creation engine is required to address the problem. Categorizing a person's life into multiple classes of information, the engine becomes a classification engine, coupled with extraction and re-ranking algorithms, and produces biographies on every aspects of a person's life. The emergence of multi-party conversations recorded in text, such as online discussions, prompted development and analyses on the summarization of such data input. Recognizing the speech aspect of this type of information, including modeling subtopic structures and the exchanges between multiple speakers, shows a significantly better quality of summaries, whose constructions are also in accordance with what human summary writers do. Text summarization evaluation previously had been limited to manual annotation or comparison on lexical identity. What separates manual and automatic matching is the ability to paraphrase, which makes automatic metrics extremely venerable. This thesis provides a solution to bridge the gap by using a large paraphrase collection that is acquired through applying statistical phrase-based machine translation (MT) algorithms on parallel data. This procedure produces a significantly higher correlation with human judgments and can become an objective function as part of a summarization system.
Design Issues of Peer-to-Peer Systems for Wireless Ad Hoc Networks
Authors: Dewan Tanvir Ahmed, Shervin Shirmohammadi
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Peer-to-peer is a popular distributed system. Mobile ad hoc networks and peer-to-peer file sharing systems both lack fixed infrastructure and hold no apriori knowledge of arriving and departing peers. Due to this common nature, P2P file sharing seems natural and attractive to be deployed for MANET. But, the resource constraints such as bandwidth, computing power, energy, etc. and node's mobility give hard challenges to the researchers. Smart content distribution and efficient content discovery are the heart of p2p protocol that controls the performance of the system. Routing is associated with every task that is expensive in ad hoc environment. In this paper, we address these issues and present a guideline to design mobile peer-to-peer systems.
Lower Bounds for Multi-Player Pointer Jumping
Authors: Amit Chakrabarti
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have major consequences in circuit complexity. We take an information complexity approach to this problem and obtain three lower bounds that improve upon earlier work. For myopic protocols (where players may see only one layer ahead but arbitrarily far behind), we greatly improve a lower bound due to Gronemeier (2006). Our new lower bound is \Omega(n/k), where n is the number of vertices per layer. For conservative protocols (where players may see arbitrarily far ahead but not behind, instead seeing only the vertex reached by following the pointers up to their layer), we extend an \Omega(n/k^2) lower bound due to Damm, Jukna and Sgall (1998) so that it applies for all k. The above two bounds apply even to the Boolean version of pointer jumping. Our third lower bound is for the non-Boolean case and for k \leqslant log n. We obtain an \Omega(n log^(k-1) n) bound for myopic protocols. Damm et al. had obtained a similar bound for deterministic conservative protocols. All our lower bounds apply directly to randomised protocols.
Discretization Using Clustering and Rough Set Theory
Authors: Girish Kumar Singh, Sonajharia Minz
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The majority of the Data Mining algorithms are applied to data described by discrete or nominal attributes. In order to apply these algorithms effectively to any dataset the continuous attribute need to be transformed to discretized ones. This paper presents an approach using Clustering and Rough Set Theory (RST). The experiments are performed on four datasets from UCI ML repository. The performance of the proposed approach is compared with some common discretization methods based on the two parameters - the number of intervals and the Class-Attribute Interdependence Redundancy (CAIR) value. The results of the proposed method show a satisfactory trade off between the number of intervals and the information loss due to discretization.
Remotely keyed encryption using non-encrypting smart cards
Authors: Stefan Lucks, Rüdiger Weis
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

Remotely keyed encryption supports fast encryption on a slow smart card. For the scheme described here, even a smart card without a builtin encryption function, would do the job, e.g., a signature card.
No universal constants: journeys of women in engineering
Authors: S. Ambrose
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Statistics are generally used to identify and address needs such as the inclusion of more women and minorities in engineering. In this paper, the authors synthesize the experiences of thirty-six engineers and six computer scientists in order to understand some of the positive and negative factors in these women's lives, and explore ways of teaching and advising in engineering schools that would allow the increasingly diverse student population to be better served. The students who reach college are a select group who have overcome the early barriers and are set on a potential track to becoming an engineer. College advisors and teachers need to reaffirm the methods and thinking these students have evolved, but which may be challenged by the system based on a "normative student" model. The authors present a theory that begins to explore these aspects.
Multilingual phrase-based concordance generation in real-time
Authors: Kumiko Tanaka-Ishii, Yuichiro Ishii
Venue: Information Retrieval (2007)

We present software that generates phrase-based concordances in real-time based on Internet searching. When a user enters a string of words for which he wants to find concordances, the system sends this string as a query to a search engine and obtains search results for the string. The concordances are extracted by performing statistical analysis on search results and then fed back to the user. Unlike existing tools, this concordance consultation tool is language-independent, so concordances can be obtained even in a language for which there are no well-established analytical methods. Our evaluation has revealed that concordances can be obtained more effectively than by only using a search engine directly.
Automatic topic identification for two-level call routing
Authors: J. Golden
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper presents an approach to routing telephone calls automatically, based upon their speech content. The data consist of a set of calls collected from a customer-service center with a two-level menu, which allows jumping past the second level, and we view the routing of these calls as a topic identification problem. Our topic identifier employs a multinomial model for keyword occurrences. We describe the call routing task in detail, discuss the multinomial model, and present experiments which investigate several issues that arise from using the model for this task.
Parameter-dependent robust stability of uncertain time-delay systems
Authors: Huijun Gao, Peng Shi, Junling Wang
Venue: Journal of Computational and Applied Mathematics (2007)

This paper presents a new delay-dependent and parameter-dependent robust stability criterion for linear continuous-time systems with polytopic parameter uncertainties and time-varying delay in the state. This criterion, expressed as a set of linear matrix inequalities, requires no matrix variable to be fixed for the entire uncertainty polytope, which produces a less conservative stability test result. Numerical examples are given to show the effectiveness of the proposed techniques.
On the Development of an Internetwork-Centric Defense for Scanning Worms
Authors: Scott E. Coull, Boleslaw K. Szymanski
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The speed with which Internet worms propagate, and their potential for carrying devastating payloads makes them a significant threat to the stability of the Internet. Current approaches for containing these worms are ineffective due to their completely local protection mechanisms -- requiring complete deployment for global worm containment. This paper suggests an alternate approach wherein the containment mechanisms are moved within the network itself rather than at end-points. This internetwork-centric approach allows networks within the Internet to not only protect themselves, but also other networks that may not have the containment technology deployed. A novel reputation-based alerting mechanism is used to ensure fair and fast information sharing. The combination of the internetwork-centric containment and reputation-based alerting allows for the creation of an Internet-wide containment mechanism that provides greater protection against fast scanning worms than any previously proposed system, and at the same time providing unequaled resilience to false positives and malicious nodes.
A fast OFDM-CDMA user demultiplexing architecture
Authors: P. Marti-Puig
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A fast algorithm based on a butterfly structure is presented that demultiplexes the symbols of a particular type of MC-MA (multi-carrier multiple-access) modulation previously proposed for indoor radio communications. A special transform is used to packetize the different symbols on the down-link such that the code sequences associated with the different symbols are transmitted synchronously at the base station. The input to the FFT bins is defined as a symbol-dependent combination of Walsh-Hadamard codes. We derive a fast architecture that can combine the common redundancy found in the Walsh-Hadamard and the inverse Fourier transform. In the direct implementation, the receiver would compute the IFFT (as in OFDM) before the Walsh-Hadamard transform. The proposed algorithm evaluates both transforms in a single step. A general expression for the butterfly weights is derived and the savings in computational complexity in terms of the frame length is evaluated.
Processing finite length signals via filter banks without border distortions: a non-expansionist solution
Authors: M. E. Dominguez Jimenez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this paper we introduce a novel and general matrix formulation of classical signal extension methods for subband processing of finite length signals. Considering a paraunitary 2-channel filter bank as a transformation cell, this new characterization makes it possible to show that perfect reconstruction of finite signals can be ensured without resorting to extra subband samples; thus, by using some traditional signal extension methods, non-expansionist transforms can be defined. Some of these transformations are analyzed to illustrate our theoretical results.
Specification-correct and Scalable Coordination of Scientific Applications in Grid Environments
Authors: Radu Prodan
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The workflow model for composing Grid applications is based on an imperative model of computation prone to programming errors, which is an issue yet to consider in the Grid community. In this paper, we propose a new unconventional model for programming Grid applications based on two programming phases: (1) formal functional specification, written by the application scientist not interested in any Grid-related issues and representing what has to be computed; (2) imperative workflow-based coordination, written by the computer scientist which indicates how to efficiently execute the specification on the Grid. A correctness checker automatically connects both parts at compiletime and ensures the correct execution of the workflow coordination with respect to the formal specification. We validate our approach for three real-world applications and show experimental results that demonstrate the correctness and scalability of our coordination model.