ppxscal/embedding_network huggingface dataset:
On the estimation of independent binomial random variables using occurrence and sequential information
Authors: B. John Oommen, Sang-Woon Kim, Geir Horn
Venue: Pattern Recognition (2007)

We re-visit the age-old problem of estimating the parameters of a distribution from its observations. Traditionally, scientists and statisticians have attempted to obtain strong estimates by 'extracting' the information contained in the observations taken as a set. However, generally speaking, the information contained in the sequence in which the observations have appeared, has been ignored-i.e., except to consider dependence information as in the case of Markov models and n-gram statistics. In this paper, we present results which, to the best of our knowledge, are the first reported results, which consider how estimation can be enhanced by utilizing both the information in the observations and in their sequence of appearance. The strategy, known as sequence based estimation (SBE) works as follows. We first quickly allude to the results pertaining to computing the maximum likelihood estimates (MLE) of the data when the samples are taken individually. We then derive the corresponding MLE results when the samples are taken two-at-a-time, and then extend these for the cases when they are processed three-at-a-time, four-at-a-time etc. In each case, we also experimentally demonstrate the convergence of the corresponding estimates. We then suggest various avenues for future research, including those by which these estimates can be fused to yield a superior overall cumulative estimate of the parameter of the distribution, in pattern recognition (PR), and in other internet and compression applications. We believe that our new estimates have great potential for practitioners, especially when the cardinality of the observation set is small.
An efficient multichannel line echo canceler algorithm for PSTN and VoIP/VoDSL applications
Authors: A. Sugiyama
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper proposes an efficient multichannel line echo canceler algorithm with interchannel distribution of computations. A limited number of coefficient adaptations are distributed among channels depending on the degree of convergence and the input signal power to achieve up to 50% reduction of total computations. Coefficient adaptations are more frequently performed in the channels where convergence is behind others and there is a sufficient input power. As the index to the degree of convergence, an averaged sum of squared coefficients is used. Its gradient weighted with the input signal power is evaluated for interchannel distribution of coefficient adaptations. Simulation results with white Gaussian signals and speech signals demonstrate good convergence. The efficiency of coefficient adaptations is improved by 30% over the conventional algorithm. The computational savings can be used to accommodate more channels on the same chip, or to cover a longer echo-path with additional delays by codecs and/or ATM cell assembly/disassembly. It is also promising for analog interface in IAD and SOHO routers for VoIP/VoDSL applications.
Location Verification Algorithms forWireless Sensor Networks
Authors: Yawen Wei, Zhen Yu, Yong Guan
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Because the knowledge of sensors' locations is very important to many location-based applications proposed for Wireless Sensor Networks, many secure localization and location verification schemes have been proposed to provide robust location estimations for sensors. We propose two lightweight location verification algorithms, namely, Greedy Filtering by Matrix (GFM) and Trustability Indicator (TI). Unlike other schemes, our algorithms do not require any specialized hardware or deployment knowledge. In GFM algorithm, the Verification Center( VC) calculates several matrices based on sensors' estimated locations and their neighborhood observations, and uses these matrixes to identify and revoke inconsistent locations. In TI algorithm, VC calculates trustability indicators for the sensors and reject those whose indicators are below a threshold. Simulation results demonstrated the effectiveness of both algorithms in detecting abnormal location and their robustness under attacks.
Design readiness: an exploratory model of object-oriented design performance
Authors: Manuel A. Perez-Quinones, Mary Beth Rosson
Venue:  (2004)

The available literature supports the fact that some students experience difficulty learning object-oriented design (OOD) principles. Previously explored predictors of OOD learning difficulties include student characteristics (cognitive activities, self-efficacy), teaching methodologies (teacher centered, course complexity), and student experiences (prior programming experience). Yet, within an extensive body of literature devoted to OOD, two explanations of student difficulty remain largely unexplored: (1) varying conceptualizations of the underlying principles/strategies of OOD, and (2) preparedness or readiness to learn OOD. This research also investigated the extent to which individual differences impacted DRAS and OOD performance. The individual difference measures of interest in this study included college grade point average, prior programming experience, cognitive abilities (spatial orientation, visualization, logical reasoning, flexibility, perceptual style), and design readiness. In addition, OOD performance was measured using two constructs: course grade (exams, labs, programs, overall), and a specially constructed design task. Participants selected from the CS2 course from two southeastern state universities were used within this study, resulting in a sample size of 161 (School A, n = 76; School B, n = 85). School A is a mid-sized comprehensive university and School B is a large research-intensive university. If was found that the schools significantly differed on all measures of prior computer science experience and cognitive abilities. Path analysis was conducted to determine which individual differences were related to design readiness and OOD performance. In summary, this research identified that instructors can not ignore individual differences when teaching OOD. It was found that the cognitive ability visualization, prior OO experience, and overall college grade point average should be considered when teaching OOD. As it stands, without identifying specific teaching strategies used at the schools within this study, this research implies that OOD may require a certain level of practical computer experience before OOD is introduced into the curriculum. The cognitive ability visualization was found to have a significant indirect relationship with overall course grade through the mediating variable design readiness. Further, the results suggest that the DRAS may serve as a viable instrument in identifying successful OOD students as well as students that require supplemental OOD instruction.
Models for automatic generation of safety-critical real-time systems
Authors: Christian Buckl, Matthias Regensburger, Alois Knoll, Gerhard Schrott
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Model-based development has become state of the art in software engineering. A number of tools, like Matlab/ Simulink or SCADE, are available for the automatic generation of application code on basis of models. Unfortunately, system aspects like process management, communication or fault-tolerance mechanisms are not covered by these tools. One main reason is the non-existence of appropriate models with an explicit semantic to allow the automatic code generation. In addition, there is a great need to have the possibility to extend both the model and the code generation abilities to allow a high coverage of the used platforms, since such code is platform dependent. In this paper, we will present an approach applying meta code generators using template-based code generation to achieve this extensibility and will discuss the properties of models required for the use in model-based development of system aspects for safety-critical real-time systems.
Event driven data processing architecture
Authors: Ingemar Söderquist
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper describes a data processing architecture where events and time are in focus. This differs from traditional von Neumann and data flow architectures. New instruction codes are defined and special circuitry is introduced to express and execute event and time operations. This results in reconfigurable software controlled functionality together with real-time performance comparable to dedicated VLSI solutions. The architecture is demonstrated in a real-time radar jammer application. The architecture is promising also for applications as routers and network processors. A prototype system on silicon (SoC), complete with signal memory, instruction memory, four processing units in parallel and interfaces for digitized signals and host computer, is fabricated in 0.35 &mu;m standard CMOS. Time events of signal data on two simultaneous 8-bit links can be programmed with a time resolution of one clock period. Measurements verified correct function and performance above 400 MHz clock frequency at 3.3 Volt supply. Power consumption is 3.6-Watt @320 MHz.
Analysis of amplifier nonlinearities on wavelet packet division multiplexing
Authors: Kin-Fai To
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Wavelet packet division multiplexing (WPDM) is a high-capacity, flexible and robust orthogonal multiplexing scheme in which wavelet packet basis functions are chosen as the coding waveforms. In this paper, characterization of the effects of amplifier nonlinearities over the WPDM signal is performed for a 16-QAM signal constellation. An expression for the symbol error probability in the presence of Gaussian noise and amplifier nonlinearities is derived.
A Novel Virtual Anchor Node-Based Localization Algorithm for Wireless Sensor Networks
Authors: Pengxi Liu, Xinming Zhang, Shuang Tian, Zhiwei Zhao, Peng Sun
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The accuracy of localization is a significant criterion to evaluate the practical utility of localization algorithm in wireless sensor networks. In mostly localization algorithms, one of the main methods to improve localization accuracy is to increase the number of anchor nodes. But the number of anchor nodes is always limited because of the hardware restrict, such as cost, energy consumption and so on. In this paper, we propose a novel algorithm with small extra logical overhead, which uses the shortest-hop path scheme to upgrade virtual anchor nodes, while the real number of physical anchors is the same as before. This algorithm firstly chooses out some special nodes from all the unknown ones to figure out more accurate positions of them, and then makes these ones as new virtual anchor nodes assist other unknowns in localizing together with the real anchors. The simulation results illustrate our algorithm has improved the accuracy of localization greatly.
Interfectio puerorum: digital projections and the 12th century fleury's massacre
Authors: Margaret Dolinsky, Timothy Nelson
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

A unique production of French Medieval liturgical dramas from the 12th century Fleury Playbook was performed on January 13th 2007 through the joined forces of Indiana University's Early Music Institute, the Henry Radford Hope School of Fine Arts, the IU Children's Chorus, and director Timothy Nelson. This new adaptation used innovated approaches to gesture, scenography, and space to question the distinctions between theater, installation, and ritual. The lighting was done with 3D computer graphic projections of iconic imagery done in digital artist oils. These digital projections evolved through the dramatic event and the performers were able to interacted with their display. This paper offers a reflective account of the production.
Analysis of the SSL 3.0 protocol
Authors: David Wagner, Bruce Schneier
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

The SSL protocol is intended to provide a practical, application-layer, widely applicable connection-oriented mechanism for Internet client/server communications security. This note gives a detailed technical analysis of the cryptographic strength of the SSL 3.0 protocol. A number of minor flaws in the protocol and several new active attacks on SSL are presented; however, these can be easily corrected without overhauling the basic structure of the protocol. We conclude that, while there are still a few technical wrinkles to iron out, on the whole SSL 3.0 is a valuable contribution towards practical communications security.
Programming network components using NetPebbles: an early report
Authors: Ajay Mohindra, Apratim Purakayastha, Deborra Zukowski, Murthy Devarakonda
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

A network-centric application developer faces a number of challenges, including distributed program design, efficient remote object access, software reuse, and program deployment issues. This level of complexity hinders the developer's ability to focus on the application logic. NetPebbles removes this complexity from the developer through a network-component based scripting environment where remote object access and program deployment are transparent to the developer. In Net-Pebbles, a developer selects needed network components from a distributed catalog, and then writes a script invoking its methods as if the components are local. When the script is launched, the run-time determines the component sites in the network and transparently moves the script as needed. Using three simple examples with different data flow patterns, we show that the NetPebbles approach is superior to the traditional client/server systems and mobile agent technologies because a scripting language is easy to use, it requires less code, and the distributed systems complexity is hidden from the programmer. This paper is an early report on the NetPebbles project, describing the motivation, design, prototype implementation, and the experiments using the NetPebbles approach.
Using Process-Level Redundancy to Exploit Multiple Cores for Transient Fault Tolerance
Authors: Alex Shye, Tipp Moseley, Vijay Janapa Reddi, Joseph Blomstedt, Daniel A. Connors
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Transient faults are emerging as a critical concern in the reliability of general-purpose microprocessors. As architectural trends point towards multi-threaded multi-core designs, there is substantial interest in adapting such parallel hardware resources for transient fault tolerance. This paper proposes a software-based multi-core alternative for transient fault tolerance using process-level redundancy (PLR). PLR creates a set of redundant processes per application process and systematically compares the processes to guarantee correct execution. Redundancy at the process level allows the operating system to freely schedule the processes across all available hardware resources. PLR's softwarecentric approach to transient fault tolerance shifts the focus from ensuring correct hardware execution to ensuring correct software execution. As a result, PLR ignores many benign faults that do not propagate to affect program correctness. A real PLR prototype for running single-threaded applications is presented and evaluated for fault coverage and performance. On a 4-way SMP machine, PLR provides improved performance over existing software transient fault tolerance techniques with 16.9% overhead for fault detection on a set of optimized SPEC2000 binaries.
Concurrency Handling in TCP
Authors: Yu Dong, Niki Pissinou, Jian Wang
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

In this paper, we propose an extension to current TCP protocol named concurrent TCP (cTCP), which can improve throughput of connections through balancing traffic load on multiple end-to-end paths. We keep the single-sliding-window architecture of TCP untouched for compatibility reasons. The two core components of the design are a packet scheduling switch that balances load among paths, and a duplicated acknowledgement classifier that handles packet reordering. We implemented our protocol in FreeBSD kernel and compared the performance of cTCP with theoretical results. Experiment outcomes show that throughputs of our protocol are close to the ideal values.
The Dynamic Organization of Space and Place
Authors: Yelena Ilkanayev
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

The rigid rectilinear forms of contemporary architectural design neither resemble nor relate the space surrounding us as an extension of the self, whether physical or mental. By "extending" or "projecting" space and form outward from the body and its movements, a new paradigm can be applied to the structure of place as it relates to the extended space of the human self. The following project proposes a method, using motion capture technology, for the design and organization of environments that are harmonious with the human self. The synergistic flow among individuals, and between the individual and his or her environment, is promoted by the organization of space around the principle of the motion of the human body. This extension of the body's form into space is informed by the natural features of an existent site. The synergistically activated space is thus reinterpreted in relation to factors produced by natural forces.
Validation of Component-Based Software with a Customer Centric Domain Level Approach
Authors: Oliver Skroch
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

End user testing for higher-order software compliance becomes an issue of increasing importance with compositional reuse of software artifacts. Few if any existing approaches discuss the validation of higher-order domain aspects in this context. The proposed method derives testable validation scenarios directly from a customer domain model by abstraction, reduction and inclusion for critical coverage. The resulting branch-free validation scenarios are used as references to validate suppliers' software specifications against. Advantages of the method are first the embedding into a clear business model, second test oracles that originate from the business domains and thus are independent from models within the software development process, and third the early availability of validation results in the development cycle, before the software itself is available.
Using bilingual comparable corpora and semi-supervised clustering for topic tracking
Authors: Fumiyo Fukumoto, Yoshimi Suzuki
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We address the problem dealing with skewed data, and propose a method for estimating effective training stories for the topic tracking task. For a small number of labelled positive stories, we extract story pairs which consist of positive and its associated stories from bilingual comparable corpora. To overcome the problem of a large number of labelled negative stories, we classify them into some clusters. This is done by using k-means with EM. The results on the TDT corpora show the effectiveness of the method.
Teaching engineering for architectural projects: a networked multimedia approach
Authors: A. C. Webster, M. B. Friedman, P. Rosenbaum
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Recent developments in software tools used for teaching architectural technology are discussed. We demonstrate a prototype interdisciplinary, networked multimedia package-an interactive analysis of Mies van der Poke's 1951 Farnsworth House-which we use to teach engineering undergraduates and graduate architecture students at Columbia University. The case study package is organized as a book-like set of multimedia materials, including: animated and textual overviews of the Farnsworth House; a description of its architectural importance; in-depth structural and building envelope thermal analyses; 3D detail models; facsimiles of construction documents; and published critical commentary. We have developed it for use on PCs via Microsoft Powerpoint on Silicon Graphics computers via Showcase, and on networked PC, Mac and Unix computers via World Wide Web browsers such as Netscape and Mosaic.
Modeling and evaluation of congestion control for different classes of network traffic: Research Articles
Authors: Lan Wang, Geyong Min, Irfan Awan
Venue: Concurrency and Computation: Practice Experience (2007)

Traffic congestion has become a crucial problem in wireless networks due to its detrimental effects on the end-to-end Quality-of-Service (QoS) of mobile users. This issue has posed various challenges to developing effective congestion control mechanisms and devising new performance evaluation tools. Various congestion control schemes have been proposed to support differentiated QoS. Among these schemes, Active Queue Management (AQM) has been recognized as an effective mechanism to manage downlink buffers in wireless networks. Most existing studies on AQM are based on the use of averaged queue length and the related performance analysis is carried out via software simulation. This paper contributes to the development of an analytical performance model for a finite capacity queuing system subject to AQM and multiple traffic classes based on the instantaneous queue length. Expressions for the aggregated and marginal performance metrics including the mean queuing length, packet loss probability, mean waiting time, system throughput, response time, and utilization are analytically derived. The validity of this new model is demonstrated by comparing the analytical results against those obtained from simulation experiments. The analytical model is then used to investigate the effects of varying thresholds on the aggregated and marginal performance metrics under different combinations of arriving rates for multiple traffic classes. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Direct Diffusion Method for the Construction of Generalized Voronoi Diagrams
Authors: Tetsushi Nishida, Shingo Ono, Kokichi Sugihara
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

We propose a new method to construct discrete Voronoi diagrams, which we call the direct diffusion method. Once we implement it as software, we can easily modify it for various types of digital Voronoi diagrams by changing only the the distance function from a point to a generator represented by a general shape. Our method can construct discrete Voronoi diagrams even if the generator points are not at the centers of pixels. Furthermore, our method can construct the Voronoi diagrams without approximating general shapes by sets of pixels.