ppxscal/embedding_network huggingface dataset:
How to Combine the Online Community with Ask the Expert System in a Health Care Site
Authors: Asa Smedberg
Venue: Proceedings of the First International Conference on the Digital Society (2007)

Online communities and so-called Ask the Expert systems aim at supporting online interaction for knowledge sharing and learning. One area where these kinds of knowledge tools have become widely used is the health care sector. Through online interaction, medical trained experts can help people with concerns about diseases and other health-related problems, and those who suffer from a certain health issue can come together to share experiences and advice. During recent years, studies have been done of the usage of different knowledge tools. However, holistic studies of the use of the two tools for online interaction have not been done. This paper presents results from a study of an online health-community and an Ask the Expert system for people who suffer from overweight. Differences and similarities in regards to knowledge sharing are presented.
A Tool for Managing Software Architecture Knowledge
Authors: Muhammad Ali Babar, Ian Gorton
Venue: Proceedings of the Second Workshop on SHAring and Reusing architectural Knowledge Architecture, Rationale, and Design Intent (2007)

This paper describes a tool for managing architectural knowledge and rationale. The tool has been developed to support a framework for capturing and using architectural knowledge to improve the architecture process. This paper describes the main architectural components and features of the tool. The paper also provides examples of using the tool for supporting well-known architecture design and analysis methods.
Constructing Face Image Logs that are Both Complete and Concise
Authors: Adam Fourney, Robert Laganiere
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper describes a construct that we call a face image log. Face image logs are collections of time stamped images representing faces detected in surveillance videos. The techniques demonstrated in this paper strive to construct face image logs that are complete and concise in the sense that the logs contain only the best images available for each individual observed. We begin by describing how to assess and compare the quality of face images. We then illustrate a robust method for selecting high quality images. This selection process takes into consideration the limitations inherent in existing face detection and person tracking techniques. Experimental results demonstrate that face logs constructed in this manner generally contain fewer than 5% of all detected faces, yet these faces are of high quality, and they represent all individuals detected in the video sequence.
Sensor Web Design Studies for Realtime Dynamic Congestion Pricing
Authors: Milton Halem, Anand Patwardhan, Sandor Dornbush, Michael Seablom, Yelena Yesha
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Traffic Congestion is a multi-billion dollar national problem and is worsening every year with population growth and increase in freight traffic. We present a model for realistic simulation studies to mitigate congestion in urban areas using dynamic congestion pricing on express toll lanes. Specifically, we identify and address the design issues needed to develop a real time event driven sensor web observation system for traffic monitoring that provides dynamic congestion pricing. To assess the feasibility of this sensor web system, we are in the process of conducting simulation studies based on real data for various system configurations to validate the mitigating impact of dynamic congestion pricing on intermodal freight flow to and from the ports in urban areas. In this paper, we focus on freight flow into the Baltimore corridor from its ports.
Topology and routing in overlay networks
Authors: Christian Scheideler
Venue:  (2007)

In this age of information, new models of information exchange methodologies based on overlay networks are gaining popular attention. Overlay networks provide a logical interconnection topology over an existing physical network. Overlay networks offer benefits such as ease of implementation, flexibility, adaptability, and incremental deployability. Due to the wide range of applications and advantages, formal study of overlay networks is required to understand the various research challenges in this context. In this thesis, we study two classes of overlay networks namely peer-to-peer networks and wireless ad hoc networks. Our focus will be along two central issues in overlay networks: how to arrive at efficient topologies and how to provide efficient routing strategies. Peer-to-peer networks have gained a lot of research attention in recent years for various reasons. Despite many advances however, fundamental questions such as how to design deterministic constructions, and how to organize peers of non-uniform bandwidth have remained open. In this thesis, we answer these questions by providing a deterministic overlay topology, Pagoda, that can be used for efficient routing, data management and multicasting. Given the difficulty of arriving at good deterministic topologies in a purely decentralized manner, we also propose a unified methodology to create a large class of overlay topologies via an approach called the supervised overlay networks. We show that this approach also has other advantages such as support for rapid peer join/leave and rapid repair. For the case of wireless ad hoc networks, we start by providing a model for wireless communication that is much more realistic than the models that are being used in the theoretical community. Using this model, we show how to arrive a sparse spanner construction based on dominating sets. We then use the spanner construction to provide efficient algorithms for broadcasting and information gathering in wireless ad hoc networks. All our algorithms are simple, self-stabilizing and require only a constant amount of storage at any node. Thus, our algorithms are also applicable in a wide variety of scenarios such as simple sensor devices.
A Framework for Workgroup Collaboration in a Vir tual Environment: Theoretical Synthesis and Empir ical Exploration
Authors: Ayoung Suh, Kyung-shik Shin
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The effects of computer-mediated communication (CMC) have been investigated within two primary research streams: task-oriented and relationshiporiented perspectives. Due to the different perspectives, as we identified, a theoretical gap exists in the CMC domain. The purpose of this paper is to combine the two different perspectives into a single unified model, thereby providing a more realistic and comprehensive understanding. The proposed model predicts both task performance and relational development in a virtual workspace. The model is tested using data gathered through a self-administered mail survey of 127 individuals of 69 virtual workgroups. The proposed model was supported, providing preliminary evidence that the two perspectives should be integrated. The results show that the individual's psychological processes (social presence and cognitive effort) in a virtual environment significantly mediated the effect of CMC inputs (media richness, user adaptation, and shared context) on the CMC outputs (task performance and relational development).
Multi-look autofocus in high resolution inverse SAR imaging
Authors: V. Luc
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Inverse synthetic aperture radar (ISAR) imaging is a technique for producing radar images of man-made targets. The relative motion between the target and the radar is the key point of the process. Autofocus motion compensation methods are commonly applied to form well focused images. But some major attributes of these images remain partially unknown. We have developed a method for estimating the relative distortions between successive images. We have applied this method to produce auto-registered multi-looks images. Results of this registration may be used for many other purposes. The method relies on the use of the RELAX algorithm for extracting the scatterers positions in each image and of a constrained minimization of a non-linear matching cost function according to a distortion model. It is applied to high resolution radar data of an aircraft and a satellite. 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
Challenges in Securing Networked J2ME Applications
Authors: Andre N. Klingsheim, Veborn Moen, Kjell J. Hole
Venue: Computer (2007)

An increasing number of smart phones support the Java 2 Platform, Micro Edition. Mobileapplication developers must deal with J2ME's inherent security weaknesses as well as bugs in implementations on real devices. Although it too has shortcomings, the new Security andTrust Services API for J2ME addresses some of these challenges.
Architectural Issues in Homogeneous NoC-Based MPSoC
Authors: Gilles Sassatelli, Nicolas Saint-Jean, Cristiane Woszezenki, Ismael Grehs, Fernando Moraes
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

Multi-Processors Systems-on-Chip (MPSoCs) are becoming increasingly popular in embedded systems for the high degree of performance and flexibility they permit. While most MPSoCs are today highly heterogeneous for better fitting the target applications, homogeneous systems may become in a near future a viable alternative bringing other benefits such as run-time load balancing. The work presented in this paper relies on a homogenous NoC-based MPSoC framework we developed which allows us to conduct evaluations of 3 different techniques: proactive/reactive communication, preemptive task mapping and task replication. The impact on the system performance is discussed for several mappings of a MJPEG decoder application.
Cooperation of Enterprises in the Area of Innovative Activity
Authors: Anna Strychalska-Rudzewicz
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Cooperation between entities of different types is of major importance for the process of developing and implementing an innovation. The aim of the paper was to present results of research concerning cooperation of enterprises in the area of innovation with their suppliers and buyers, with other enterprises and with scientific institutions (institution carrying scientific research) as well as organizations dealing with transfer of innovations. The study using questionnaire covered 156 enterprises from the region of northeastern Poland, which declared introducing product and/or process innovations. The cooperation occurred most frequently within the chain of supplier-processor- buyer, which is consistent with the global trends. The cooperation was much more frequently undertaken by larger entities and it involved a wide range of partner institutions. Small and medium enterprises represent a low level of cooperation with innovation transfer institutions.
Discovering Manufacturing Process from Timed Data: the BJT4R Algorithm
Authors: Benayadi Nabil, Le Goc Marc, Bouche Philippe
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

This paper addresses the problem of discovering and modeling a manufacturing process from the timed data contained in a monitoring data base. The modeling approach, called the stochastic approach, aims at producing temporal patterns under the form of abstract chronicle models from a homogenous Markov chain and its corresponding superposition of Poisson processes representing a sequence of timed data generated by supervision system. The paper presents the BJT4R algorithm (Backward Jump with Timed constraints For Road) that implements the stochastic approach to discover the most probable paths linking a discrete event class to another and its application to the wafer manufacturing process of a production plant of the STMicroelectronics Company1. The aim of this application is to discover models of "manufacturing roads" with the associated timed constraints to improve the wafer manufacturing process. This paper shows that the stochastic approach and the BJT4R is applicable to this aim.
APPSSAT: Approximate probabilistic planning using stochastic satisfiability
Authors: Stephen M. Majercik
Venue: International Journal of Approximate Reasoning (2007)

We describe appssat, an anytime probabilistic contingent planner based on zander, a probabilistic contingent planner that operates by converting the planning problem to a stochastic satisfiability (Ssat) problem and solving that problem instead [S.M. Majercik, M.L. Littman, Contingent planning under uncertainty via stochastic satisfiability, Artificial Intelligence 147 (2003) 119-162]. The values of some of the variables in an Ssat instance are probabilistically determined; appssat considers the most likely instantiations of these variables (the most probable situations facing the agent) and attempts to construct an approximation of the optimal plan that succeeds under those circumstances, improving that plan as time permits. Given more time, less likely instantiations/situations are considered and the plan is revised as necessary. In some cases, a plan constructed to address a relatively low percentage of possible situations will succeed for situations not explicitly considered as well, and may return an optimal or near-optimal plan. We describe experimental results showing that appssat can find suboptimal plans in cases in which zander is unable to find the optimal (or any) plan. Although the test problems are small, the anytime quality of appssat means that it has the potential to efficiently derive suboptimal plans in larger, time-critical domains in which zander might not have sufficient time to calculate any plan. We also suggest further work needed to bring appssat closer to attacking real-world problems.
Scribbles: an exploratory study of sketch based support for early collaborative object oriented design.
Authors: Christopher James Martin
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Scribbles represents a light weight intuitive tool to support early collaborative software design. Collaboration is not well supported in many modern CASE (computer aided software engineering) environments making paper and white boards an attractive alternative. As a result of this, CASE tools tend to be more suited to documenting designs rather than assisting the generation of a design, meaning that early ideas may be lost. Scribbles uses shape recognition, to allow freehand manipulation of a hybrid Mind Map. This preserves the simplicity of paper or a whiteboard whilst adding the ability to capture early design ideas in a reusable way. This is a very lightweight modeling environment ideally suited to introducing students to Object Oriented Design.
Improving environmental robustness in large vocabulary speech recognition
Authors: P. C. Woodland
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper describes techniques to improve the robustness of the HTK large vocabulary speech recognition system to non-ideal acoustic environments. The primary methods are single-pass retraining using stereo training data; parallel model combination which combines HMMs trained on clean data with estimates of convolutional and additive noise; and maximum likelihood linear regression which estimates a set of linear transformations of the model parameters to the current conditions. Experiments are reported on both the 1994 ARPA CSR S5 (alternate microphones) and S10 (additive noise) spoken tasks and the 1995 ARPA CSR H3 task (multiple unknown microphones). The HTK system yielded the lowest error rates in both the H3-P0 and HS-C0 tests.
Clustering-training for Data Stream Mining
Authors: Shuang Wu, Chunyu Yang, Jie Zhou
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Mining data streams has attracted much attention recently. Labeled samples needed by most current stream classification methods are more difficult and expensive to obtain than unlabeled ones. This paper proposed a semisupervised learning algorithm - clustering-training to utilize the unlabeled samples. It uses clustering to select confidently unlabeled samples, and uses them to re-train the classifier incrementally. Experiments on synthetic and real data set showed the effectiveness of the proposed algorithm.
Error-resilience in multimedia applications over ad-hoc networks
Authors: L. E. Doyle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Ad-hoc networking has been of increasing interest in recent years. It encapsulates the ultimate notion of ubiquitous communications with the absence of reliance on any existing network infrastructure. This paper presents a concept for robust operation of multimedia applications over such networks. Error resilient communication is achieved by using a new error detection and concealment technique that exploits information from the decoded image data itself as well as using information from the underlying network. This approach unifies information from both traditional computer science and signal processing domains. A layered architecture framework for the implementation of the proposed system is also described.
Modeling And Verification Of Real-Time Systems
Authors: Cengiz Erbas, Murat M. Tanik
Venue: Journal of Integrated Design Process Science (2003)

One aspect that separates real-time programs from sequential and concurrent programs is that correctness depends not only on the logical correctness but also on the temporal properties of the system. In a multiprocessor environment, the allocation of processes among processors and the scheduling policy of each processor are two essential parameters that affect timing behavior of the system, and should be considered in formal modeling and verification techniques. In this paper, we introduce a precedence graph based model for real-time systems. Then, based on this model, we develop an axiomatic approach to reason about the timing behavior of real-time programs. The approach is demonstrated for maximal parallelism and priority based preemptive scheduling.
MVDR based all-pole models for spectral coding of speech
Authors: M. N. Murthi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We present several analytical properties of minimum variance distortionless response (MVDR) based all-pole models that demonstrate the advantages and usefulness of these models for speech spectral coding. In particular, we show that a sufficient order MVDR all-pole model provides a spectral envelope that fits a set of spectral samples exactly with a parameterization convenient for quantization purposes. In addition, we show that MVDR all-pole filters provide a monotonically decreasing spectral distortion with increasing filter order. Furthermore, we show that the MVDR all-pole filter possesses the flexibility to be obtained from correlations based upon either spectral samples or conventional time-domain correlations. Finally, exploiting the insight gained from MVDR modeling, we introduce a novel class of constrained all-pole models for efficient spectral coding. In this approach, a subset of the line spectral frequency (LSF) parameters associated with the all-pole model are judiciously fixed, leading to a simpler model parameterization.
Random backtracking in backtrack search algorithms for satisfiability
Authors: I. Lynce, J. Marques-Silva
Venue: Discrete Applied Mathematics (2007)

This paper proposes the utilization of randomized backtracking within complete backtrack search algorithms for propositional satisfiability (SAT). In recent years, randomization has become pervasive in SAT algorithms. Incomplete algorithms for SAT, for example the ones based on local search, often resort to randomization. Complete algorithms also resort to randomization. These include state-of-the-art backtrack search SAT algorithms that often randomize variable selection heuristics. Moreover, it is plain that the introduction of randomization in other components of backtrack search SAT algorithms can potentially yield new competitive search strategies. As a result, we propose a stochastic backtrack search algorithm for SAT, that randomizes both the variable selection and the backtrack steps of the algorithm. In addition, we relate randomized backtracking with a more general form of backtracking, referred to as unrestricted backtracking. Finally, experimental results for different organizations of randomized backtracking are described and compared, providing empirical evidence that the new search algorithm for SAT is a very competitive approach for solving hard real-world instances.
Hierarchical classification of audio data for archiving and retrieving
Authors: Tong Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A hierarchical system for audio classification and retrieval based on audio content analysis is presented in this paper. The system consists of three stages. The first stage is called the coarse-level audio classification and segmentation, where audio recordings are classified and segmented into speech, music, several types of environmental sounds, and silence, based on morphological and statistical analysis of temporal curves of short-time features of audio signals. In the second stage, environmental sounds are further classified into finer classes such as applause, rain, bird sound, etc. This fine-level classification is based on time-frequency analysis of audio signals and use of the hidden Markov model (HMM) for classification. In the third stage, the query-by-example audio retrieval is implemented where similar sounds can be found according to an input sample audio. It is shown that the proposed system has achieved an accuracy higher than 90% for coarse-level audio classification. Examples of audio fine classification and audio retrieval are also provided.
Information technology and the autonomy&mdash;control duality: toward a theory
Authors: Ali Tafti, Sunil Mithas, M. S. Krishnan
Venue: Information Technology and Management (2007)

We examine the relationship between firms' human resources (HR) practices and their information technology (IT) practices, focusing on the dichotomy between autonomy and control. We define facilitating HR practices as those that exhibit the following characteristics: worker autonomy, connectedness, learning, valuing individuals, trust, and flexibility in business processes. We then characterize facilitating IT practices, which are practices that facilitate employee collaboration, autonomy, and wider access to information. We contrast these categories of practice to traditional HR and monitoring IT, respectively. Drawing from theories of complementarities and configuration, we propose that alignment between HR and IT strategies originates at the level of individual practices. We consider the effects of this alignment on worker performance. We then ground our discussion in exploratory empirical and qualitative results.