ppxscal/embedding_network huggingface dataset:
Probability of Undetected Error on a Binary Symmetric Channel without Memory via Bayesian Inference
Authors: H. D. Wacker, J. Borcsok
Venue: Proceedings of the Second International Conference on Systems (2007)

One of the main problems in calculating the probability of undetected error of a linear code on a Binary Symmetric Channel (BSC) is the lack of information about the bit error probability of the channel. To avoid such problems, a new definition of the probability of undetected error is given making use of Bayesian Inference, provided the value of the bit error probability can be estimated by means of a sample. The length of the samples tending to infinity, the sequence of the respective undetected error probabilities turns out to be convergent. The results then are related to the problem of meeting a specific Safety Integrity Level (SIL).
A new classifier based on resource limited artificial immune systems
Authors: A. Watkins, L. Boggess
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents a new tool for supervised learning, modeled on resource limited Artificial Immune Systems. A supervised learning system, it is self-regulatory, efficient, and stable under a wide range of user-set parameters. Its performance is comparable to well-established classifiers on a variety of testbeds, including the iris data, the diabetes classification problem, the ionosphere problem, and the rock/metal classification problem for mine detection.
Social Computing: From Social Informatics to Social Intelligence
Authors: Fei-Yue Wang, Kathleen M. Carley, Daniel Zeng, Wenji Mao
Venue: IEEE Intelligent Systems (2007)

Social computing has become a hot topic attracting broad interest from not only researchers but also technologists, software and online game vendors, Web entrepreneurs, business strategists, political analysts, and digital government practitioners, to name a few. This article discusses social computing's theoretical, methodological, and technological underpinnings; reviews major application areas; and raises key research issues.
Sealing OS processes to improve dependability and safety
Authors: Galen Hunt, Mark Aiken, Manuel Fähndrich, Chris Hawblitzel, Orion Hodson, James Larus, Steven Levi, Bjarne Steensgaard, David Tarditi, Ted Wobber
Venue: Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 (2007)

In most modern operating systems, a process is a hardware-protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms---dynamic code loading, run-time code generation, shared memory, and intrusive system APIs---make the barrier between processes very permeable. This paper argues that this traditional open process architecture exacerbates the dependability and security weaknesses of modern systems. As a remedy, this paper proposes a sealed process architecture, which prohibits dynamic code loading, self-modifying code, shared memory, and limits the scope of the process API. This paper describes the implementation of the sealed process architecture in the Singularity operating system, discusses its merits and drawbacks, and evaluates its effectiveness. Some benefits of this sealed process architecture are: improved program analysis by tools, stronger security and safety guarantees, elimination of redundant overlaps between the OS and language runtimes, and improved software engineering. Conventional wisdom says open processes are required for performance; our experience suggests otherwise. We present the first macrobenchmarks for a sealed-process operating system and applications. The benchmarks show that an experimental sealed-process system can achieve performance competitive with highly-tuned, commercial, open-process systems.
Internet anxiety: An empirical study of the effects of personality, beliefs, and social support
Authors: Jason Bennett Thatcher, Misty L. Loughry, Jaejoo Lim, D. Harrison McKnight
Venue: Information and Management (2007)

We examined sources of Internet anxiety; specifically modeling the ties from broad dispositional traits (computer anxiety, computer self-efficacy, and personal innovativeness with IT), beliefs about the work environment (about the adequacy of resources and trust in technology), and two forms of social support for IT (leader and peer support) to individuals' anxiety about using Internet applications. We tested our model using respondents who participated in virtual teams during a 16-week period. Our findings suggested that Internet anxiety was affected both by the users' personality and by beliefs that can be influenced by providing adequate resources to support the technology, encourage trust in technology, and working to assure users that leaders and peers are supportive of their using the technology. Our findings suggest that by providing appropriate resources and fostering a supportive environment, leaders could reduce Internet anxiety and thus influence the use of technology in the workplace in ways that benefit organizations.
Symbolic and numeric quantum circuit simulation
Authors: Alexandre de A. Barbosa, Bernardo Junior Lula, Aercio Ferreira de Lima
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

Simulation fulfills an important mechanism for the study and the development of many areas. Quantum computation simulation tools have become essential, because no effective quantum hardware has been implemented yet. However, the currently available simulators have serious deficiencies, which makes the description of this new computational paradigm incomplete. This article presents an universal quantum circuit simulator, called Zeno, and the symbolic extension that is being developed to it. The extension will allow a symbolic description of the system's state allied to the graphical representation of the circuit be visualized together. At this, users will be able to work in faster and more efficient way than making this calculations by hand. The extension will make possible a faithful description of the system computation like the descriptions observed in related literature.
Modeling Evaluation Of Continuous Queries on SlidingWindows
Authors: Anita Dani, Janusz Getta
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

One of the distinguishing characteristics of a data stream system is 'a continuous query operating on dynamic data' as opposed to 'static data processed by instantaneous query' in DBMS. Due to potentially infinite size of the stream a query is evaluated after forming finite subsets of the data stream. The sliding window model is the most suitable model for processing finite subsets of a data stream where only recent data items qualify. In this paper, we propose a mathematical model to express a continuous query on sliding windows. This model expresses a window as an ordered set. Its sliding mechanism is expressed through a set of transition operations and query evaluation is expressed through a set of output operations.
A polyphase and FFT realization of modulation sub-band adaptive filter with minimum sampling rate
Authors: K. Nakayama
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this paper, a polyphase and FFT realization of a sub-band adaptive filter is proposed. In the polyphase and FFT realization for the transmultiplexer, the sampling rate reduction is the same as the number of the sub-bands. In the proposed method, however, they are different, so the conventional method cannot be applied. In the new realization, the polyphase filters are divided into a tapped delay line and an FFT part so as to be shared by all the sub-bands. Computational complexity is well reduced compared with the direct realization.
Evaluating SIP server performance
Authors: Erich M. Nahum, John Tracey, Charles P. Wright
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

SIP is a protocol of growing importance, with uses for VoIP, instant messaging, presence, and more. However, its performance is not well-studied or understood. In this extended abstract we overview our experimental evaluation of common SIP server scenarios using open-source SIP software such as OpenSER and SIP prunning on Linux. We show performance varies greatly depending on the server scenario and how the protocol is used. Depending on the configuration, through put can vary from hundreds to thousands of operations per second. For example, we observe that the choice of stateless vs. stateful proxying, using TCP rather than UDP, or including MD5-based authentication can each can affect performance by a factor of 2-4. We also provide kernel and application profiles using Oprofile that help explain and illustrate processing costs. Finally, we provide a simple fix for transaction-stateful proxying that improves performance by a factor of 10. Full details can be found in our accompanying technical report.
Automatic Verification and Discovery of Byzantine Consensus Protocols
Authors: Piotr Zielinski
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of low-latency Byzantine Consensus protocols. It reduces the state space by focusing on the latency-determining first round only, ignoring the order of messages in this round, and distinguishing between state-modifying actions and state-preserving predicates. In addition, the monotonicity of the predicates and verified properties allows one to use a Tarski-style fixpoint algorithm, which results in an exponential verification speed-up. This model checker has been applied to scan the space of possible Consensus algorithms in order to discover new ones. The search automatically discovered not only many familiar patterns but also several interesting improvements to known algorithms. Due to its speed and reliability, automatic protocol design is an attractive paradigm, especially in the notoriously difficult Byzantine case.
Nanoelectronics Device Technologies: CMOS, Beyond and the Mysterious Case of Ockham's Razor
Authors: Sandip Tiwari
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Devices (and underlying materials and technology) are a starting point towards circuits, and ultimately systems designed using an appropriate architecture that can provide properties desired for the electronics environment. The current research in silicon nanoscale transistor area has a preponderance of efforts aimed towards improvement in electrostatics such as using nanowires and multiple gates or electrodynamics such as using strain to improve transport. I will discuss the more interesting of these as well as other unconventional attempts, and argue that while in the tradition of scaling and Moore's law this looks appropriate, the imperatives of research of the moment are quite different and a significantly broader look is required.
Convergence properties of the block orthogonal projection algorithm
Authors: K. Ikeda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The normalized LMS (N-LMS) algorithm has a disadvantage that the convergence rate is much worse when the input signal is colored. To overcome this, the affine projection algorithm and the block orthogonal projection (BOP) algorithm which applied the block signal processing technique to the N-LMS algorithm are proposed although the reason why they are tough against the colored signal is not given yet. This paper gives the convergence rate of the BOP algorithm for colored input signals, which shows the superiority of the BOP algorithm. To put it concretely, we derive the expression of the convergence rate, propose an approximation method to calculate it, and confirm the result by computer simulations. We also consider the relation between the block size and the convergence rate formally and geometrically.
Using courseware authoring to mentor faculty of the future
Authors: B. Hoyt
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This paper discusses a novel method for recruiting faculty members-particularly female and minority faulty members-by introducing students to the duties and responsibilities of faculty members at an early stage of their undergraduate career. Students assisted faculty in preparation of electronic courseware in a ten-week long summer program as well as during the school year. Student participants were teamed with faculty mentors from their discipline. The courseware design was based on Kolb cycle principles for use in undergraduate courses. In addition to participating in their development teams, all students met weekly in a large group setting. In those meetings background material like Kolb cycle principles, were presented to the students, or they shared and critiqued their courseware design as well as discussing issues relating to life as a faculty member. Students were chosen for this project on the basis of an expressed interest in attending graduate school and in pursuing a career in academia. Nineteen students have participated in this program over a period of 4 years.
Model Checking of Software Components: Combining Java PathFinder and Behavior Protocol Model Checker
Authors: Pavel Parizek, Frantisek Plasil, Jan Kofron
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

Although there exist several software model checkers that check the code against properties specified e.g. via a temporal logic and assertions, or just verifying low-level properties (like unhandled exceptions), none of them supports checking of software components against a high-level behavior specification. We present our approach to model checking of software components implemented in Java against a high-level specification of their behavior defined via behavior protocols [1], which employs the Java PathFinder model checker and the protocol checker. The property checked by the Java PathFinder (JPF) tool (correctness of particular method call sequences) is validated via its cooperation with the protocol checker. We show that just the publisher/listener pattern claimed to be the key flexibility support of JPF (even though proved very useful for our purpose) was not enough to achieve this kind of checking.
Database Support for Weighted Match Joins
Authors: Ameet Kini, Jeffrey F. Naughton
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics that differ from those appropriate for traditional RDBMS applications. Two interesting ideas currently being explored in the DBMS community are ranking query results (e.g., top-k computations) and, more recently, "match joins." In this paper we combine these two ideas and study weighted match joins, in which (a) like match joins, each tuple joins with at most one matching tuple, and (b) like top-k joins, the system attempts to provide a set of answer tuples that maximizes a weight function. We explore exact and approximate strategies for evaluating weighted match joins. Using a prototype implementation in PostgreSQL, we explore the performance characteristics of these strategies. Our results suggest that the DBMS optimization-based approach of providing several implementations of an operator and then choosing an appropriate one at run time can be useful in computing weighted match joins.
Control Engineering: New Trends with OO Modelling Approach
Authors: Borut Zupancic, Rihard Karba
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The paper deals with two examples, which show the efficiency of OO modelling approach in control engineering. The first example - an optimization of three tank hydraulic control system shows the efficiency of the OO modelling approach in control engineering education. A very efficient environment is the combination of Matlab Simulink and a Modelica based OO environment Dymola. Two different control strategies -- PID and cascade control are demonstrated. The second example shows the efficiency of OO modelling approach in an industrial application. DYMOLA-Modelica was efficiently used for studying a pendulum system in a stone wool production technology in a Slovenian company. In this system linear (horizontal) movement of a bottom edge of the pendulum system is a very important technological feature in forming the secondary wool layer. The simulation results showed that it is possible to achieve more appropriate movements with regard to position and velocity.
A typing system for an optimizing multiple-backend Tcl compiler
Authors: Forest Rouse, Wayne Christopher
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

This paper describes the typing system used by the ICE 2.0 Tcl compiler[Rouse]. The typing system tracks the usage of variables and allows the compiler to reduce the number of instructions required to carry out Tcl instructions. It will also allow future improvements in code emission by making it possible to carry out standard compiler analyses and optimizations[Aho].
WormShield: Fast Worm Signature Generation with Distributed Fingerprint Aggregation
Authors: Min Cai, Kai Hwang, Jianping Pan, Christos Papadopoulos
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

Fast and accurate generation of worm signatures is essential to contain zero-day worms at the Internet scale. Recent work has shown that signature generation can be automated by analyzing the repetition of worm substrings (that is, fingerprints) and their address dispersion. However, at the early stage of a worm outbreak, individual edge networks are often short of enough worm exploits for generating accurate signatures. This paper presents both theoretical and experimental results on a collaborative worm signature generation system (WormShield) that employs distributed fingerprint filtering and aggregation over multiple edge networks. By analyzing real-life Internet traces, we discovered that fingerprints in background traffic exhibit a Zipf-like distribution. Due to this property, a distributed fingerprint filtering reduces the amount of aggregation traffic significantly. WormShield monitors utilize a new distributed aggregation tree (DAT) to compute global fingerprint statistics in a scalable and load-balanced fashion. We simulated a spectrum of scanning worms including CodeRed and Slammer by using realistic Internet configurations of about 100,000 edge networks. On average, 256 collaborative monitors generate the signature of CodeRedI-v2 135 times faster than using the same number of isolated monitors. In addition to speed gains, we observed less than 100 false signatures out of 18.7-Gbyte Internet traces, yielding a very low false-positive rate. Each monitor only generates about 0.6 kilobit per second of aggregation traffic, which is 0.003 percent of the 18 megabits per second link traffic sniffed. These results demonstrate that the WormShield system offers distinct advantages in speed gains, signature accuracy, and scalability for large-scale worm containment.
Managing shrubs on powerline corridors in central new york: findings from the environmental complex
Authors: Christopher A. Nowak
Venue:  (2007)

Shrub community development and management were studied on powerline corridors in central New York State to improve understanding and management of shrublands, which have high conservation value, yet continue to decline regionally as abandoned agricultural lands revert to forest. Maintaining shrub communities often requires vegetation management restricting tree invasion and growth. Regular, intensive vegetation management to control tall-growing trees using both mechanical and chemical treatments on powerline corridors allows managers to potentially, strongly affect the development of shrub communities. While mechanical treatments are generally understood as being useful in tending and regenerating shrubs due to the resprouting capacity of many deciduous woody species, they are not often used to directly culture shrub communities. It is not clear how important vegetation management treatments are to shrub community development relative to other factors in the environmental complex. I hypothesized that the use of mechanical treatments on powerlines would increase shrub abundance. I used an observational-analytical approach to study site- and disturbance-related factors, coupled with species life histories and community dynamics, to explore how and why shrub communities differed along a 23-km section of corridor on two adjacent 20- to 30-year old powerlines with contrasting vegetation management treatment histories. Observed shrub distributions were consistent with known life history characteristics and generally varied more as a function of past land use and soil-site factors than vegetation management. Interacting land-use history, site, and vegetation management treatments variably affected species distributions, resulting in complex vegetation states. A concurrent, manipulative field experiment was conducted to evaluate the potential of coppicing with a mechanical brush saw to stimulate lateral expansion and rejuvenation of two shrub species: Cornus racemosa and Viburnum dentatum. Results of the study indicated that this coppicing method was not effective at increasing the rate of shrub expansion of either species into areas previously unoccupied by shrub stems, but was effective at rejuvenating both shrubs by stimulating basal sprouting and root suckering within previously occupied areas. Collectively, my two studies generally did not support the hypothesis that mechanical treatments lead directly to an increase in the abundance of shrubs. Investigation of treatments that disturb roots and soil seems warranted as it may be needed to stimulate expansion and colonization by some shrub species. Furthermore, a holistic perspective is needed in vegetation science that recognizes the importance of both contemporary and historic human influences in the environmental complex as a basis for vegetation management.
Wafer Level Reliability Screens
Authors: Peter Maxwell
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

This tutorial discusses test methods and voltage stress approaches required to ensure effective cost effective defect screening to produce high quality, reliable products. Wafer level reliability screens (WLRS) refers to the application of screens during wafer test that will both activate and detect a sufficient number of defects so that early life failure rate (ELFR) is reduced enough to meet customer spec, preferably without doing burn-in. Further, these screens have to have acceptable yield loss and acceptable test times.
Design of blind decision feedback equalizers for Markovian time varying channels
Authors: S. Cherif
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this paper, a new class of blind algorithms designed for decision feedback equalization of time varying channels, is proposed. We consider Markovian time variations of the impulse response of the channel as in radio mobile communications. The main idea is to modify classical blind algorithms (decision-directed, constant modulus algorithm,...) in order to give them self-adaptive knowledge of the channel non-stationarity. Simulations show that the proposed algorithms non-stationary DD and non-stationary CMA present better tracking capacity than the classical ones. Hence, they are able to improve the bit error rate especially for severe propagation conditions.