ppxscal/embedding_network huggingface dataset:
Understanding theWeb Page Layout
Authors: Minghong Zhou, Rubao Li, Wei Li
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Web pages express their semantics not only by free texts, but also by their layouts. While information is explicitly encoded in free texts, the layout implicitly uncovers the semantical relationships of the free texts. In this paper, we proposed a framework for mining the semantics implied by the layout. The core of our work is a new HTML document model, called nested table model, which synthesize the DOM model and the syntax of HTML language. By the nested table model, we could formally define the relevancy of free texts. And hence, free texts could be grouped by their relevancy. Our experiment results indicate that the relevancy correctly reflects the semantics of web page layout.
Effects of Low-Quality Computation Time Estimates in Policed Schedulers
Authors: Justin M. Wozniak, Yingxin Jiang, Aaron Striegel
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Researchers conducting computer simulations can often provide estimates of computation time for a given type of simulation, which may be used by the compute cluster to aid in resource allocation and scheduling. However, the low quality of these estimates can cause deadline misses and unpredictable behavior. This problem is exacerbated on complex compute resources, clusters, and grids. Past-deadline jobs may be killed to provide resources for others, but the effect on the throughput of whole batches not fully understood. In this paper, we examine models for simple job schedulers and examine the quality of the deadline guarantee given. Simulation results based on actual runtimes are provided and discussed.
Group creativity in virtual math teams: interactional mechanisms for referencing, remembering and bridging
Authors: Johann W. Sarmiento, Gerry Stahl
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

In this paper, we present a qualitative case study of group creativity online in the domain of mathematics. We define creative work broadly, ranging from the micro-level co-construction of novel resources for problem solving to the innovative reuse of ideas and solution strategies across virtual teams. We analyze the collaborative interactions of virtual math teams with an emphasis on describing the relationship between "synchronic" aspects of creative work (i.e. single episode interactions) and their "diachronic" evolution across time and across collectivities. Our analysis indicates that the synergy between these two types of interactions and the resulting creative engagement of the teams relies on three fundamental processes: (1) referencing and the "configuration of indexicals", (2) collective remembering, and (3) bridging across discontinuities. In addition we also reflect on the aspects of the online environment used by these virtual teams which promote, support or hinder diachronic and synchronic interactions and creativity as aspects of group cognition.
Time-Domain Passivity Control of Haptic Interfaces with Tunable Damping Hardware
Authors: Andrew H. C. Gosline, Vincent Hayward
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

We describe a time-domain passivity control methodology that uses programmable eddy current viscous dampers to prevent a user from extracting energy from a haptic interface. A passivity observer monitors the energy flow of the virtual environment, and damping hardware is used to remove any energy contributions from the virtual environment that violate passivity constraints. Experiments illustrate that the programmable physical damper method improves the performance of a haptic device that has minimal inherent dissipation.
An evolutionary strategy for decremental multiobjective optimization problems: Research Articles
Authors: Sheng-Uei Guan, Qian Chen, Wenting Mo
Venue: International Journal of Intelligent Systems (2007)

In this article, an evolutionary algorithm for multiobjective optimization problems in a dynamic environment is studied. In particular, we focus on decremental multiobjective optimization problems, where some objectives may be deleted during evolution&mdash;for such a process we call it objective decrement. It is shown that the Pareto-optimal set after objective decrement is actually a subset of the Pareto-optimal set before objective decrement. Based on this observation, the inheritance strategy is suggested. When objective decrement takes place, this strategy selects good chromosomes according to the decremented objective set from the solutions found before objective decrement, and then continues to optimize them via evolution for the decremented objective set. The experimental results showed that this strategy can help MOGAs achieve better performance than MOGAs without using the strategy, where the evolution is restarted when objective decrement occurs. More solutions with better quality are found during the same time span. &copy; 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 847&ndash;866, 2007.
Locally optimum and rank-based known signal detection in correlated alpha-stable interference
Authors: C. L. Brown
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The problem of detecting known signals in the presence of correlated interference with symmetric alpha-stable excitation is considered. An estimation procedure for the signal strength is devised, based on the minimum dispersion criterion, then blind channel identification is performed. Several detection schemes are presented based on locally optimum (LO) and locally optimum rank (LOR) procedures, as well as some more computationally efficient suboptimal tests. The approximate distributions of the corresponding test statistics are derived. Simulation results indicate the levels of significance are maintained and all detectors achieve similar detection rates. The conclusion is drawn that the LOR and the suboptimal tests are able to achieve near locally optimal performance but with a far lighter computational burden.
The effects of creativity software's characteristics on electronic brainstorming in different proximity settings
Authors: John M. Pearson
Venue:  (2006)

Based on earlier studies on Group Support Systems (GSS), this research attempted to examine factors that influence idea creativity in an electronic brainstorming session: interaction mode and proximity. Idea creativity contained four aspects: idea fluency, idea flexibility, idea elaboration, and idea originality. We hypothesized that groups using creativity software could achieve higher level of idea creativity than groups using traditional brainstorming, and groups using creativity software graphic mode could achieve higher level of idea creativity than groups using outline mode. Additionally, we hypothesized that groups meeting in the same place could achieve higher level of idea creativity than groups meeting in different places. We also hypothesized that the combination of software mode and group proximity would significantly affect the level of idea creativity. The results indicated that groups meeting in different places had a higher level of idea creativity than those meeting in the same place, and that software mode did not significantly influence the total number of ideas generated. Moreover, the combination of software mode and location did not significantly affect the level of idea creativity in electronic brainstorming groups. This meant that a particular group could have the same level of idea creativity as another group in the experiment, and creativity software might not be able to enhance idea creativity. Overall, the findings of this preliminary study on creativity software characteristics are interesting and provide motivation for further research in this area. It is believed that the findings from this research will have both managerial implication for practitioners employing creativity software in different business settings (face-to-face, virtual team, etc.), and academic implication for researchers who are interested in electronic brainstorming or other GSS-based tasks in different time/place settings. Researchers can also use the results as a guideline for future research that aims to examine GSS-support activities as well as IT communication support, and this stream of research can create knowledge about factors and group setting that enhance idea creativity, about individual and organization characteristics that affect idea creativity, and about user satisfaction resulted from idea creativity.
Optimised performance of a 23 GHz transceiver system for point-to-point microwave link
Authors: V. Rahayu, J. Din, T. A. Rahman
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Point-to-point microwave radio is being increasingly deployed because of the rapid expansion of commercial wireless services. Providers of wireless services continue to demand systems with higher data rates and higher carrier frequencies. This paper presents the system design of a 23 GHz transceiver that has 2/spl times/2 Mbps data rate for point-to-point microwave link. The designed system is simulated using Advanced Design System (ADS) from Agilent's for performance measurement and analysis. The 23 GHz microwave radio system comprises a double conversion up-converter and down-converter. A total noise figure not exceeding 3 dB is obtained over the 22.994 - 23.554 GHz frequency range. The power transmitted is 25.4 dBm. The design of transceiver involves the proper selection and arrangement of microwave components to meet the European Telecommunications Standards Institute (ETSI) recommendations for point-to-point equipment in fixed radio systems operating at 23 GHz. As future work, a prototype of a 23 GHz transceiver will also be developed. Further improvement will be considered to enhance the transceiver performance.
Software Platforms--How to Win the Peace
Authors: Tim Romberg
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We look at three historical case studies to investigate how software platforms evolve after their initial establishment. The success of a platform often creates new dynamics among the complementers which question the original architecture.
Build Up Organizational Innovativeness: An Integrated View
Authors: Mohamed Khalifa, Angela Yan Yu, Kathy Ning Shen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Innovativeness has been regarded as an important organizational capacity to secure long-run competitive position and bottom-line performance. Prior research from different disciplines has shed some light on the capability-building process for innovativeness. However, an integrated understanding is still missing. This study is aimed to address this void. Based on resource-based view, this study integrates the strategic, process, technological factors to explain the development of innovativeness and further examines their interactive relationships. The research model was tested with 114 organizations that have implemented KMS applications. The empirical results provide strong support for our research model. The theoretical and practical implications are discussed.
Discriminating DEA efficient candidates by considering their least relative total scores
Authors: Ying-Ming Wang, Kwai-Sang Chin
Venue: Journal of Computational and Applied Mathematics (2007)

Data envelopment analysis very often identifies more than one candidate in a voting system to be DEA efficient. In order to choose a winner from among the DEA efficient candidates, this paper proposes a new method that discriminates the DEA efficient candidates by considering their least relative total scores. The proposed method is illustrated with two numerical examples and proves to be effective and practical.
Nail-mounted tactile display for boundary/texture augmentation
Authors: Hideyuki Ando, Eisuke Kusachi, Junji Watanabe
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We developed a device that can superimpose tactile information onto an object displayed on a computer monitor. With this device, we can present tactile sensations of boundaries or textures corresponding to the visual image. The device is composed of a small voice coil, and the tactile sensations are generated by controlling the modulation of the waveforms. For demonstration proposes, the device is integrated with a tool that allows users to draw a picture easily with their fingertips while experiencing tactile feedback.
Comparing call graphs
Authors: Ond∨rej Lhoták
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

Comparing program analysis results from different static and dynamic analysis tools is difficult and therefore too rare, especially when it comes to qualitative comparison. Analysis results can be strongly affected by specific details of programs being analyzed, so quantitative evaluation should be supplemented by qualitative identification of those details. Our general aim is to develop tools to reduce the difficulty of qualitative comparison. In this paper, we focus on comparison of call graphs in particular. We present two complementary tools for comparing call graphs. Our main contribution is a call graph difference search tool that ranks call graph edges by their likelihood of causing large differences in the call graphs. This is complemented by a simple interactive call graph viewer that highlights specific differences between call graphs, and allows a user to browse through them. In a search for the causes of call graph differences, a user first uses the search tool to identify which of the thousands of spurious edges to look at more closely, and then uses the interactive viewer to determine in detail the root cause of a difference. We present the ranking algorithm used in the difference search tool. We also report on a case study using the comparison tools to determine the most important sources of imprecision in a typical static call graph by comparing it to a dynamic call graph of the same benchmark.
The soft-output m-algorithm and its applications
Authors: Kitty Kar Yan Wong
Venue:  (2006)

The Soft-Output M-Algorithm (SOMA) is a reduced-complexity trellis decoder based on a sequential decoding technique known as the M-algorithm. Instead of extending all survivors from one trellis depth to the next, it extends only from the best M. The remaining survivors are terminated. The novelty of the SOMA is the use of terminated paths to obtain reliable soft-information. Soft-information is extracted from terminated paths through a simple update-and-discard procedure. It is found that using the M best fully-extended survivors alone is inadequate to deliver soft-information due to their similarity. On the other hand, terminated paths of a pruned trellis carry a significant amount of soft-information which should not be ignored for reliable bit-detection. The SOMA is particularly useful in reducing the complexity of an iterative receiver. Applications include turbo equalization of single-input single-output Inter-Symbol Interference (ISI) channels and Multiple-Input Multiple-Output (MIMO) frequency selective fading channels, iterative decoding of MIMO flat fading channels, and multi-user detection and equalization in coded Direct-Sequence Code-Division Multiple-Access (DS-CDMA) systems. For turbo equalization of a 16-tap ISI channel with convolutional coding, nearoptimal bit-error-rate is achieved by retaining only 128 (out of 32,768) states. The SOMA is also applicable to reduce the complexity of tree decoding. For a coded MIMO system with 8 antennae transmitting 64-QAM symbols over a flat fading channel, the respective code-tree with 648 hypotheses can be decoded with the SOMA by retaining only 32 paths per tree depth. The complexity of multi-user detection for coded DS-CDMA systems for flat-fading channels can also be significantly reduced using the SOMA. High-order trellises with millions of states can also be decoded with modest complexity using the SOMA. The trellis is first expanded into an equivalent trellis/tree structure. Then, the M-algorithm is applied twice, once to reduce the number of states, and the other to reduce the number of branches emanating from each state. The proposed method gives promising results in equalizing a high-order modulated MIMO system with bit-interleaved coded modulation undergoing frequency selective fading. The method is also applicable to reduce the complexity of multi-user equalization of a coded DS-CDMA system undergoing frequency selective fading.
Buffer control technique for transmission frequency recovery of CBR connections over ATM networks
Authors: G. Panza
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The transmission of audio-video coded signals in real time applications over ATM networks requires sophisticated techniques for synchronization and buffer control. The presence of ATM cell delay variation (CDV) represents the major jitter source affecting the reconstruction of the time reference signal associated to the actual real-time service. In this paper is presented a buffer control technique and the related implementation aspects, based on both measure and utilization of CDV statistics or alternatively making use of buffer occupation statistics. The system allows setting target jitter attenuation in a way to have pre-established buffer underflow and overflow probabilities and its optimal utilization. The presented technique can be further extended to any asynchronous network context and is particularly suitable for high demanding professional audio-video applications.
Duplicate Elimination in Space-partitioning Tree Indexes
Authors: M. Y. Eltabakh, Mourad Ouzzani, Walid G. Aref
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of indexing non-zero extent objects, e.g., line segments and rectangles, space-partitioning trees may replicate objects over multiple space partitions, e.g., PMR quadtree, expanded MX-CIF quadtree, and extended kd-tree. As a result, the answer to a query over these indexes may include duplicates that need to be eliminated, i.e., the same object may be reported more than once. In this paper, we propose generic duplicate elimination techniques for the class of space-partitioning trees in the context of SP-GiST; an extensible indexing framework for realizing space-partitioning trees. The proposed techniques are embedded inside the INDEX-SCAN operator. Therefore, duplicate copies of the same object do not propagate in the query plan, and the elimination process is transparent to the end-users. Two cases for the index structures are considered based on whether or not the objects' coordinates are stored inside the index tree. The theoretical and experimental analysis illustrate that the proposed techniques achieve savings in the storage requirements, I/O operations, and processing time when compared to adding a separate duplicate elimination operator in the query plan.
Design of non-expansionist and orthogonal extension methods for tree-structured filter banks
Authors: M. E. Dominguez Jimenez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Signal extension methods have been extensively used when applying filter banks to finite length sequences. However, not every extension guarantees perfect reconstruction without considering extra subband samples, that is, in some cases the associated transform is expansionist. In this paper we introduce first the most general method for designing signal extensions which yield non-expansionist subband transforms. Secondly, all orthogonal extension methods are constructed. We conclude by analyzing some examples of the new boundary filters associated to the proposed extensions.
The Personal Software Process
Authors: W. S. Humphrey
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Summary form only given. The Personal Software Process (PSP)/sup TM/ promises to be a powerful tool for software educators. The author describes the PSP and some results achieved by using it. The author also discusses the principles behind the PSP and the reasons why it is effective as a teaching instrument. The author suggests some implications of the PSP for software education. The principal PSP objective is to demonstrate the benefits of using a defined process, planning and tracking development work, measuring engineering performance, and managing work quality. The PSP is introduced with a family of processes and a set of exercises. By following the processes to do the ten exercises, engineers learn the methods and they see from their own data how the methods work for them.
Approximate probability propagation with mixtures of truncated exponentials
Authors: Rafael Rumí, Antonio Salmerón
Venue: International Journal of Approximate Reasoning (2007)

Mixtures of truncated exponentials (MTEs) are a powerful alternative to discretisation when working with hybrid Bayesian networks. One of the features of the MTE model is that standard propagation algorithms can be used. However, the complexity of the process is too high and therefore approximate methods, which tradeoff complexity for accuracy, become necessary. In this paper we propose an approximate propagation algorithm for MTE networks which is based on the Penniless propagation method already known for discrete variables. We also consider how to use Markov Chain Monte Carlo to carry out the probability propagation. The performance of the proposed methods is analysed in a series of experiments with random networks.
Collaborative Culture and Perceived Issues with University-to-Industry Knowledge Transfer
Authors: Karan J. Sorensen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The generation, application, and exploitation of knowledge are becoming critical to how companies, countries, and economies develop and sustain competitive advantage. Some firms are better able to utilize externally generated technologies and scientific knowledge, such as knowledge transferred from universities. This paper will examine the following questions: 1) Does a collaborative culture better enable a firm to be connected both internally and externally? 2) What potential issues and barriers exist for technology transfer as perceived by managers in the firm? We will attempt to identify key sources of literature relative to firm characteristics, expand the concept of connectedness to include the importance of a collaborative culture to better enable a firm to be connected both internally and externally, and identify potential issues and barriers for technology transfer as perceived by the firm. We present findings from a survey and interviews with R&D managers from the pharmaceutical division within a large corporation (confidential name) broadly based in healthcare and the life sciences.