ppxscal/embedding_network huggingface dataset:
An examination of user resistance in mandatory adoption of enterprise systems
Authors: James Ellis Blanton
Venue:  (2006)

User resistance is an important issue in the implementation of an Enterprise System (ES). However, despite the prevalence of user adoption literature, user resistance literature is scarce. Although some studies have conceptualized user resistance as the opposite of user adoption, a mandatory, role-transforming system such as an ES clearly shows that users may use a system while resisting it. Although this area is highly relevant, it is theoretically underdeveloped. This study examines user resistance at the individual level of analysis to determine the underlying reasons for user resistance, the types of resistant behaviors, and the management strategies to minimize resistance. It also seeks to understand the types of users that exist during an implementation and in particular, the groups of resisters. This dissertation identifies four categories of reasons for user resistance, which comprise a total of twelve reasons for user resistance. Resistant behaviors are also identified and classified. Three categories of management strategies are also identified, comprising a total of eight management strategies that are useful in minimizing user resistance. Groups of ES users are also described and examined.
Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms
Authors: Matthieu Gallet, Yves Robert, Frederic Vivien
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

In this paper, we study the problem of scheduling file transfers through a switch. This problem is at the heart of a model often used for large grid computations, where the switch represents the core of the network interconnecting the various clusters that compose the grid. We establish several complexity results, and we introduce and analyze various algorithms, from both a theoretical and a practical perspective.
Investigation of effectiveness of microphone arrays for in car use based on sound field simulation
Authors: V. Galanenko
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The effectiveness of small microphone arrays for in car use is investigated. These arrays are designed for speech enhancing in a noise background within the cabin of a moving car. Speech and noise simulation based on a designed mathematical algorithm of sound field modeling within a car cavity is applied for predicting the effectiveness of the spatial-time processing algorithms. The mathematical model takes into account complicated cabin geometry, the difference of sizes in the wavelength scale at low and high frequencies, frequency dependent sound absorption of the cabin surfaces and distributed noise sources with their cross correlation. Theoretical estimates of the microphone array effectiveness and output simulated signals (for subjective estimation) are presented.
Events and Sightings
Authors: Chigusa Kita
Venue: IEEE Annals of the History of Computing (2007)

This department features stories on Russian/Soviet Computing, the Virtual IPSJ Computer Museum, the Society for the History of Technology's 2006 annual meeting, and a call for stories on robotics.
An efficient MIMO receiver structure for coded signals
Authors: E. Karami, M. Shiva, M. Khansari
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

A new near optimum receiver for linear MIMO channels is proposed. The main structure of this receiver is based on estimation of spatial signature matrix and soft joint detection of the received signal. In the proposed joint detector, by some modification on the feedback structure of iterative joint detectors, the probability of convergence to local minima is decreased. From various simulations, it has been shown that the receiver is efficient for trellis MPSK coded signals. The computational complexity of the channel estimator and soft joint detector has a linear relationship with the number of transmitter and receiver antennas and the tracking speed of the channel estimator is relatively sufficient. Therefore, the proposed receiver can be used in high bit rate wireless communication services.
Undisrupted quality-of-service during reconfiguration of multiple applications in networks on chip
Authors: Andreas Hansson, Martijn Coenen, Kees Goossens
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Networks on Chip (NoC) have emerged as the design paradigm for scalable System on Chip (SoC) communication infrastructure. Due to convergence, a growing number of applications are integrated on the same chip. When combined, these applications result in use-cases with different communication requirements. The NoC is configured per use-case and traditionally all running applications are disrupted during use-case transitions, even those continuing operation. In this paper we present a model that enables partial reconfiguration of NoCs and a mapping algorithm that uses the model to map multiple applications onto a NoC with undisrupted Quality-of-Service during reconfiguration. The performance of the methodology is verified by comparison with existing solutions for several SoC designs. We apply the algorithm to a mobile phone SoC with telecom, multimedia and gaming applications, reducing NoC area by more than 17% and power consumption by 50% compared to a state-of-the-art approach.
SCAP: Smart Caching inWireless Access Points to Improve P2P Streaming
Authors: Enhua Tan, Lei Guo, Songqing Chen, Xiaodong Zhang
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

The increasing number of wireless users in Internet P2P applications causes two new performance problems due to the requirement of uploading the downloaded traffic for other peers, limited bandwidth of wireless communications, and resource competition between the access point and wireless stations. First, an active P2P wireless user can significantly reduce the downloading throughput of other wireless users in the WLAN. Second, the slowdown of a P2P wireless user communication can also delay its relay and data sharing service for other dependent wired/wireless peers. In order to address these problems, in this paper, we pro- pose an efficient caching mechanism called SCAP (Smart Caching in Access Points). Conducting intensive Inter- net measurements on representative P2P streaming appli- cations, we observe a high percentage of duplicated data packets in successive downloading and uploading data streams. Through duplication detection and caching at the access point, these duplicated packets can be com- pressed so that the uploading traffic in the WLAN is signif- icantly reduced. Our prototype-based experimental evalua- tion demonstrates that by effectively reducing the redundant P2P traffic in the WLAN, SCAP improves the throughput of the WLAN by up to 88% and reduces the response delay to other Internet users meanwhile.
Evaluating the Post-Delivery Fault Reporting and Correction Process in Closed-Source and Open-Source Software
Authors: Liguo Yu, Kai Chen
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Post-delivery fault reporting and correction are important activities in the software maintenance process. It is worthwhile to study these activities in order to understand the difference between opensource and closed-source software products from the maintenance perspective. This paper proposes three metrics to evaluate the post-delivery fault reporting and correction process, the average fault hidden time, the average fault pending time, and the average fault correction time. An empirical study is further performed to compare the fault correction processes of NASA Ames (closed-source) projects and three opensource projects: Apache Tomcat, Apache Ant, and Gnome Panel.
Robust semantic role labeling
Authors: Wayne Ward
Venue:  (2006)

The natural language processing community has recently experienced a growth of interest in domain independent semantic role labeling. The process of semantic role labeling entails identifying all the predicates in a sentence, and then, identifying and classifying sets of word sequences, that represent the arguments (or, semantic roles) of each of these predicates. In other words, this is the process of assigning a WHO did WHAT to WHOM, WHEN, W HERE, WHY, HOW etc. structure to plain text, so as to facilitate enhancements to algorithms that deal with various higher-level natural language processing tasks, such as---information extraction, question answering, summarization, machine translation, etc., by providing them with a layer of semantic structure on top of the syntactic structure that they currently have access to. In recent years, there have been a few attempts at creating hand-tagged corpora that encode such information. Two such corpora are FrameNet and PropBank. One idea behind creating these corpora was to make it possible for the community at large, to train supervised machine learning classifiers that can be used to automatically tag vast amount of unseen text with such shallow semantic information. There are various types of predicates, the most common being verb predicates and noun predicates. Most work prior to this thesis was focused on arguments of verb predicates. This thesis primarily addresses three issues: (i) improving performance on the standard data sets, on which others have previously reported results, by using a better machine learning strategy and by incorporating novel features, (ii) extending this work to parse arguments of nominal predicates, which also play an important role in conveying the semantics of a passage, and (iii) investigating methods to improve the robustness of the classifier across different genre of text.
A unification of relaxation labeling and associative memory
Authors: X. Zhuang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper attempts to consolidate the theoretical foundation of the relaxation labeling processes, explore the connections between the relaxation labeling model and the Hopfield associative memory model, and seek their unification. We start by defining a new labeling assignment space and then formulate the relaxation labeling process as a dynamic system of Lyapunov type, which is equipped with a well-defined energy function and described by a naturally fitted updating rule. We present a consistency condition and show that each /spl omega/-limit point of the dynamic system gives a consistent labeling. We finally make a peace between the multi-label and one-label relaxation labeling and reveal an interesting result that, for a one-label case, the newly formulated relaxation labeling model reduces to the Hopfield associative memory model.
Performance analysis of third-order nonlinear Wiener adaptive systems
Authors: Shue-Lee Chang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper presents a detailed performance analysis of third order nonlinear adaptive systems based on the Wiener model. In earlier work, we proposed the discrete Wiener model for adaptive filtering applications for any order. However, we had focused mainly on first and second-order nonlinear systems in our previous analysis. Now, we present new results on the analysis of third order systems. All the results can be extended to higher-order systems. The Wiener model has many advantages over other models such as the Volterra model. These advantages include less number of coefficients and faster convergence. The Wiener model performs a complete orthogonalization procedure to the truncated Volterra series and this allows us to use linear adaptive filtering algorithms like the LMS to calculate all the coefficients efficiently. Unlike the Gram-Schmidt procedure, this orthogonalization method is based on the nonlinear discrete Wiener model. It contains three sections: a single-input multi-output linear with memory section, a multi-input, multi-output nonlinear no-memory section and a multi-input, single-output amplification and summary section. Computer simulation results are also presented to verify the theoretical performance analysis results.
A Parallel VLSI Architecture for Layered Decoding for Array LDPC Codes
Authors: Kiran K. Gunnam, Gwan S. Choi, Mark B. Yeary
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The VLSI implementation complexity of a low density parity check (LDPC) decoder is largely influenced by interconnect and the storage requirements. Here, the proposed layout-aware layered decoder architecture utilizes the data-reuse properties of min-sum, layered decoding and structured properties of array LDPC codes. This results in a significant reduction of logic and interconnects requirements of the decoder when compared to the state-of-the-art LDPC decoders. The ASIC implementation of the proposed fully parallel architecture achieves throughput of 4.6 Gbps (for a maximum of 15 iterations). The chip size is 2.3 mm x 2.3 mm in 0.13 micron technology.
Web 2.0 and SOA: Converging Concepts Enabling the Internet of Services
Authors: Christoph Schroth, Till Janner
Venue: IT Professional (2007)

By examining and contrasting Web 2.0 and SOA, we envision a new Internet of Services that incorporates the best of both.
A Distributed Trust Establishment Scheme for Mobile Ad Hoc Networks
Authors: Jaydip Sen, Piyali Roy Chowdhury, Indranil Sengupta
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Wireless ad hoc networks have generated much interest, both in research literature and the telecommunication industry. The attractiveness of these networks lies in the fact that unlike other wireless networks, ad hoc networks are self-organized: the hosts constituting the networks can communicate with each other without reliance on centralized or specialized entities such as base stations. As these networks find more application, the need for adequate security mechanism is increasingly becoming important. Trust establishment and management are essential for any security framework of these networks. In this paper, we present a trust establishment scheme for ad hoc networks based on distributed trust model. A trust initiator is introduced only in the system-bootstrapping phase to initiate the protocol. A fully self-organized trust establishment approach is then adopted to handle the dynamic topology of the network and the membership changes of the nodes, while ensuring trust establishment among the nodes with shorter trust chains and very high probability. The simulation results show that our scheme is highly robust and scalable in the dynamic environment of ad hoc networks.
Providing reliable NT desktop services by avoiding NT server
Authors: Thomas A. Limoncelli, Robert Fulmer, Thomas Reingold, Alex Levine, Ralph Loura
Venue: Proceedings of the 1998 Conference on Large Installation System Administration of Windows NT (1998)

We have developed a reliable, stable NT Desktop environment for our customers. The services we provide include: Standard desktop applications (word processing, spreadsheet, etc.), access to UNIX compute servers, file storage and backups, e-mail, printing, calendar, netnews, web, and Internet access. We founded our architecture by selecting open, standard protocols rather than specific applications. This decoupled our client application selection process from our server platform selection process. We could then choose the server based on our needs for reliability, scalability, and manageability and let customers independently choose their clients based on their needs of platform (NT or UNIX), features, and preferences. We can now choose between competing server products rather than be locked into the (potentially difficult to manage) server required for a particular client application. This created a "no compromises" environment on the desktop as well as in our server room. Our customers are happy because the "tail" doesn't "wag the dog". Our ability to manage this infrastructure is superior because the dog doesn't wag the tail either. The resulting system gives us a strong base to build new services.
On Symbolic Verification of Weakly Extended PAD
Authors: Ahmed Bouajjani, Jan Strejček, Tayssir Touili
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We consider the verification problem of a class of infinite-state systems called wPAD. These systems can be used to model programs with (possibly recursive) procedure calls and dynamic creation of parallel processes. They correspond to PAD models extended with an acyclic finite-state control unit, where PAD models can be seen as combinations of prefix rewrite systems (pushdown systems) with context-free multiset rewrite systems (synchronization-free Petri nets). Recently, we have presented symbolic reachability techniques for the class of PAD based on the use of a class of unranked tree automata. In this paper, we generalize our previous work to the class wPAD which is strictly larger than PAD. This generalization brings a positive answer to an open question on decidability of the model checking problem for wPAD against EF logic. Moreover, we show how symbolic reachability analysis of wPAD can be used in (under) approximate analysis of Synchronized PAD, a (Turing) powerful model for multithreaded programs (with unrestricted synchronization between parallel processes). This leads to a pragmatic approach for detecting the presence of erroneous behaviors in these models based on the bounded reachability paradigm where the notion of bound considered here is the number of synchronization actions.
Tracking multiple mice through severe occlusions
Authors: Serge Belongie, Sanjoy Dasgupta
Venue:  (2007)

In this thesis, I address the problem of tracking multiple identical mice through severe occlusions from video of a side of their cage. A solution to this problem would greatly benefit medical research because of the key role animal testing plays in medical research. As the majority of visual tracking algorithms are intended for tracking people or cars, they are not directly applicable to the mouse tracking problem. Mice are extremely deformable, unconstrained three-dimensional objects. They have few trackable features, and their motion is extremely erratic. In addition, the mice are visually indistinguishable. Thus, to keep track of identities one must track the mice through sometimes complete occlusions. Furthermore, because of the constraints of the application, we had little control over the content of the video sequence. Thus, the bedding of the cage was hard to distinguish from the mice, and the mice were also occluded by scratches on the front of the cage. In this thesis, I break up the tracking problem into parts: defining a state representation for the mice, defining an appearance model, defining a motion model, and inferring statistics of the positions of the mice for a novel video sequence given the defined model. Because of the difficulty and uniqueness of the mouse tracking problem, it was necessary to understand, modify, combine, and invent state-of-the-art approaches to each of these parts of the tracking problem. In this thesis, I describe and motivate the solutions chosen for each of these subproblems.
CALIC-a context based adaptive lossless image codec
Authors: Xiaolin Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We propose a context-based, adaptive, lossless image codec (CALIC). CALIC obtains higher lossless compression of continuous-tone images than other techniques reported in the literature. This high coding efficiency is accomplished with relatively low time and space complexities. CALIC puts heavy emphasis on image data modeling. A unique feature of CALIC is the use of a large number of modeling contexts to condition a non-linear predictor and make it adaptive to varying source statistics. The non-linear predictor adapts via an error feedback mechanism. In this adaptation process, CALIC only estimates the expectation of prediction errors conditioned on a large number of contexts rather than estimating a large number of conditional error probabilities. The former estimation technique can afford a large number of modeling contexts without suffering from the sparse context problem. The low time and space complexities of CALIC are attributed to efficient techniques for forming and quantizing modeling contexts.
Least-squares CMA with decorrelation for fast blind multiuser signal separation
Authors: F. R. P. Cavalcanti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A blind algorithm with implicit signal selectivity capability is proposed. The algorithm is an evolution of the original multiuser constant modulus algorithm of Papadias and Paulraj (see IEEE Sig. Proc. Letters, vol.4, no.6, p.178-81, 1997). The new algorithm features a least-squares type updating rule for fast convergence rate and an adaptive control of the weight of the decorrelation term which improves the steady-state error variance. The expected improvements of the proposed algorithm are verified through simulations with smart antennas in a spatial-division multiple access system.
3G-WLAN Convergence: Vulnerability, Attacks Possibilities and Security Model
Authors: Muhammad Sher, Thomas Magedanz
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In this paper we present the vulnerability, threats and attacks for Third Generation (3G) networks converged with WLAN and propose the security model addressing the roaming and non-roaming security scenarios. Many threats against 3G network resources can be realised by attacking the WLAN access network, therefore it is important to identify the security requirements for 3G-WLAN inter-working and choose a security solution that is robust and dynamic to different levels of WLAN access network. The proposed architecture is based on the Extensible Authentication Protocol (EAP) for USIM Authentication & Key Agreement (AKA) and authorization procedures, and secure tunnel establishment using IKEv2 (Internet Key Exchange) Protocol to minimize security threats. We will also discuss the termination of fake or forge WLAN session to protect the user confidential information on vulnerable wireless link. The development is part of Secure Service Provisioning (SSP) Framework of IP Multimedia System (IMS) at 3Gb Testbed of Fokus Fraunhofer.
Cookies along trust-boundaries (CAT): accurate and deployable flood protection
Authors: Martin Casado, Aditya Akella, Pei Cao, Niels Provos, Scott Shenker
Venue: Proceedings of the 2nd conference on Steps to Reducing Unwanted Traffic on the Internet - Volume 2 (2006)

Packet floods targeting a victim's incoming bandwidth are notoriously difficult to defend against. While a number of solutions have been proposed, such as network capabilities, third-party traffic scrubbing, and overlay-based protection, most suffer from drawbacks that limit their applicability in practice. We propose CAT, a new network-based flood protection scheme. In CAT, all flows must perform a three-way handshake with an in-network element to obtain permission to send data. The three-way handshake dissuades source spoofing and establishes a unique handle for the flow, which can then be used for revocation by the receiver. CAT offers the protection qualities of network capabilities, and yet does not require major architectural changes.