ppxscal/embedding_network huggingface dataset:
Design of static linear multivariable output feedback controllers using random optimization techniques
Authors: Ali Khaki-Sedigh, Yazdan Bavafa-Toosi
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

New necessary and sufficient conditions for multivariable pole placement (MVPP) and entire eigenstructure assignment (EEA) through static linear multivariable output feedback are established. It is shown that the resultant matrix is of full rank and all design freedoms are retained. The problem of static linear multivariable output feedback control law design is then defined. Based on the EEA concept and sufficiency of the regional pole placement, the design is (re)formulated in terms of a constrained nonlinear optimization problem. To this end, some decoupling indices for noninteractive performance are defined, their necessary and sufficient conditions are derived and tracker design is addressed. The problem formulation well suits the application of random/intelligent optimization techniques. By way of this approach, optimal robust stability/performance, noninteractive performance, reliability, actuator limitations and low sensitivity in the face of structured or unstructured plant uncertainties are achieved. The effectiveness of the proposed methodology is demonstrated by simulation results using genetic algorithm.
Generation of Fault Tests for Linear Logic Networks
Authors: M. A. Breuer
Venue: IEEE Transactions on Computers (1972)

In this note we study the problem of fault detection in linear logic networks. We introduce the concept of error vectors that indicate how the effect of a fault propagates through a network. These vectors allow one to identify redundancies in the network as well as calculate the output of the network given a fault and an input. Problems related to fault diagnosis and the detection of multiple faults are also considered.
An "S-string" scheme for business-oriented peer-to-peer networks
Authors: Manaf Zghaibeh, Fotios C. Harmantzis
Venue: Electronic Commerce Research (2007)

In this paper we introduce and analyze S-string, a Peer-to-Peer (P2P) payment-based mechanism. S-string enhances the functionality of P2P networks by promoting cooperation among peers, rewarding them to participate in sharing objects, and encouraging them to reduce their downtimes. It also imposes tougher punishment procedures on peers when they do not fulfill their obligations to others. S-string supports the role of media entities by taking into consideration their concerns about the distribution of digital media contents or objects in a lawful and profitable manner. We demonstrate the performance results of our proposed mechanism via simulation.
Color/font/text size: developing standards for video podcast
Authors: Laurie J. Patterson
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

A great deal of research has been done focusing on font, text size, and background colors for use with PowerPoint and on Web pages; but no research has been done to aid in the development of PowerPoint presentations for use on small screen devices such as the iPod. In this study, the researcher developed a PowerPoint that tested font size and clarity, text color against background, as well as clarity of images and graphs and found that much of what works in a quality PowerPoint presentation for computer screens does not work for small screens. This paper presents the result of this study and suggests some guidelines that can be used to create video podcasts that can be viewed in a variety of settings; thereby making the video podcast a useful extension of the classroom PowerPoint.
Adaptive tuning of fuzzy membership functions for non-linear optimization using gradient descent method
Authors: Prashant S. Vishnupad, Yung C. Shin
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

This paper presents an adaptive fuzzy tuner for the optimization of non-linear, multi-variable problems. The gradient-descent method is used to adaptively tune the bases of the membership functions used in the fuzzy logic optimization. The performance of the optimization with adaptive tuning is tested in comparison with fuzzy optimization without adaptive tuning of membership functions. It is shown that the adaptive fuzzy optimization provides better performance by converging to the optimal value in lesser time and fewer iterations. A multi-variable, non-linear optimization problem is shown as an illustrative example to demonstrate improved performance. This adaptive tuning scheme has also been incorporated into the Generalized Intelligent Grinding Advisory System (GIGAS II) and results show that even for very complex problems such as manufacturing processes, improved performance can be obtained.
A Study of Information Granules
Authors: Xiaosheng Wang
Venue: Proceedings of the 2007 IEEE International Conference on Granular Computing (2007)

Rough set theory is based on information granules. This paper studies information granules based on a decision logic language in information tables. In this paper, the theorems of determining definable granules and definable partitions are given. Furthermore, this paper gives the definitions of the definable upper and lower approximations of indefinable granules, and studies their properties. Through the descriptions of the definable upper and lower approximations, we propose a way of describing indefinable granules. As a result, we can obtain some explicit and useful information on indefinable granules. This is then an approach to discover knowledge hidden in indefinable granules.
Improved Approximation Results for the Minimum Energy Broadcasting Problem
Authors: Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes
Venue: Algorithmica (2007)

In this paper we present new results on the performance of the Minimum Spanning Tree heuristic for the Minimum Energy Broadcast Routing (MEBR) problem. We first prove that, for any number of dimensions d&#x2265;2, the approximation ratio of the heuristic does not increase when the power attenuation coefficient &#x03b1;, that is the exponent to which the coverage distance must be raised to give the emission power, grows. Moreover, we show that, for any fixed instance, as a limit for &#x03b1; going to infinity, the ratio tends to the lower bound of Clementi et al. (Proceedings of the 18th annual symposium on theoretical aspects of computer science (STACS), pp.&#x00a0;121&#x2013;131, 2001), Wan et al. (Wirel. Netw. 8(6):607&#x2013;617, 2002) given by the d-dimensional kissing number, thus closing the existing gap between the upper and the lower bound. We then introduce a new analysis allowing to establish a 7.45-approximation ratio for the 2-dimensional case, thus significantly decreasing the previously known 12 upper bound (Wan et al. in Wirel. Netw. 8(6):607&#x2013;617, 2002) (actually corrected to 12.15 in Klasing et al. (Proceedings of the 3rd IFIP-TC6 international networking conference, pp.&#x00a0;866&#x2013;877, 2004)). Finally, we extend our analysis to any number of dimensions d&#x2265;2 and any &#x03b1;&#x2265;d, obtaining a general approximation ratio of 3d&#x2212;1, again independent of &#x03b1;. The improvements of the approximation ratios are specifically significant in comparison with the lower bounds given by the kissing numbers, as these grow at least exponentially with respect to d.
Program Instrumentation and Software Testing
Authors: J. C. Huang
Venue: Computer (1978)

The program tester needs to know what goes on inside a program as it executes during a test Instrumentation methods permit collection of testing coverage data without modifying the logical properties of programs being tested.
An Efficient Lossless Compression Algorithm for Well Logging Result Drawings
Authors: Yong Shi, Liqiang He, Yihong Wen, Bo Li, Zhengzhang Chen
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Since the data of Well Logging Result Drawings is so large, it is necessary to apply efficient algorithm to compress them. Based on the lossless compression of LZMA (Lempel-Ziv-Markov chain-Algorithm), this paper presents a new compressing algorithm for Well Logging Result Drawings after analyzing Result Drawings in CGM (Computer Graphics Metafile) format. The experiment results indicate that the compression ratio of the proposed new algorithm for the Result Drawings with cgm format is larger than currently popular compression software. The new algorithm is also suitable to compress Result Drawings in any other vector format.
Multi-attribute fuzzy time series method based on fuzzy clustering
Authors: Ching-Hsue Cheng, Guang-Wei Cheng, Jia-Wen Wang
Venue: Expert Systems with Applications: An International Journal (2008)

Traditional time series methods can predict the seasonal problem, but fail to forecast the problems with linguistic value. An alternative forecasting method such as fuzzy time series is utilized to deal with these kinds of problems. Two shortcomings of the existing fuzzy time series forecasting methods are that they lack persuasiveness in determining universe of discourse and the length of intervals, and that they lack objective method for multiple-attribute fuzzy time series. This paper introduces a novel multiple-attribute fuzzy time series method based on fuzzy clustering. The methods of fuzzy clustering are integrated in the processes of fuzzy time series to partition datasets objectively and enable processing of multiple attributes. For verification, this paper uses two datasets: (1) the yearly data on enrollments at the University of Alabama, and (2) the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) futures. The forecasting results show that the proposed method can forecast not only one-attribute but also multiple-attribute data effectively and outperform the listing methods.
A Difficult Abstraction
Authors: Danny Ayers
Venue: IEEE Internet Computing (2007)

The developer community is generally overloaded with what they see, leading to simplifications that encourage the development of systems that are inconsistent with underlying specifications.
Best practices and tools for personal information compliance management
Authors: M. Kudo, Y. Araki, H. Nomiyama, S. Saito, Y. Sohda
Venue: IBM Systems Journal (2007)

Recent incidents involving the loss of personal information and identity theft have raised concerns worldwide over information privacy. In Japan, the Personal Information Protection Act went into effect in April 2005, requiring every enterprise to manage sensitive personal information on servers, workstations, and personal computers throughout the organization. This paper describes two tools we developed to assist in the management of personal information, a Designer and the Personal Information Detection (PID) tool. The a Designer tool scans an entire Web site to determine if each HTML page complies with the IBM privacy guidelines for external Web sites. PID is capable of automatically identifying "named entities," such as personal names, addresses, or telephone numbers in the textual parts of target files based on Japanese morphological analysis technology. This paper also summarizes the best practices used in IBM Japan for privacy management and presents statistical results concerning personal information gathered through deployment of these tools.
Design of Two-Level Fault-Tolerant Networks
Authors: D. K. Pradhan
Venue: IEEE Transactions on Computers (1974)

Some new techniques for the synthesis of fault-tolerant two-level combinational networks are presented. Two classes of faults are defined, 1) critical faults and 2) subcritical faults. Critical fauls are the class of faults that cannot be tolerated by any two-level networks. Necessary conditions for synthesis of networks tolerating subcritical faults are developed. As a result it is established that the conditions required for tolerating faults in the logic elements and those required for tolerating faults in the primary inputs are significantly different. Several design techniques are presented and it is shown that if we restrict our class of faults, then certain normally assumed conditions on redundancy can be relaxed. A class of hazards is defined. It is shown that the synthesis of certain hazard-free realizations is equivalent to the fault-tolerant realization, and also an upper bound on the redundancy of the fault-tolerant realization is derived.
Supporting Proof in a Reactive Development Environment
Authors: Farhad Mehta
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Reactive integrated development environments for software engineering have lead to an increase in productivity and quality of programs produced. They have done so by replacing the traditional sequential compile, test, debug development cycle with a more integrated and reactive development environment where these tools are run automatically in the background, giving the engineer instant feedback on his most recent change. The RODIN platform provides a similar reactive development environment for formal modeling and proof. Using this reactive approach places new challenges on the proof tool used. Since proof obligations are in a constant state of change, proofs in the system must be represented and managed to be resilient to these changes. This paper presents a solution to this problem that represents proof attempts in a way that makes them resilient to change and amenable to reuse.
VoIP defender: highly scalable SIP-based security architecture
Authors: Jens Fiedler, Tomas Kupka, Sven Ehlert, Thomas Magedanz, Dorgham Sisalem
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

VoIP services are becoming increasingly a big competition to existing telephony services (POTS / ISDN). The increasing number of customers using VoIP makes VoIP services a valuable target for attackers that want to bring down the service, take it over or simply abuse it to distribute their own content, like SPAM. Hence, the need arises to protect VoIP services from all kinds of attacks that target network bandwidth, server capacity or server architectural constrains. In this article we present VoIP Defender, a generic security architecture, called VoIP-Defender, to monitor, detect, analyze and counter attacks relevant for a SIP-based VoIP infrastructure. The VoIP-Defender is highly scalable and can be easily extended with new detection algorithms. Analysis and traffic control can be performed from the SIP layer down to the transport-, network- and MAC layer. VoIP Defender is designed to work fully transparent to clients and SIP servers, and can analyze and filter traffic in real time, which we demonstrate with measurements with our implementation.
Reducing the Impact of the MemoryWall for I/O Using Cache Injection
Authors: Edgar A. Leon, Kurt B. Ferreira, Arthur B. Maccabe
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

Cache injection addresses the continuing disparity be- tween processor and memory speeds by placing data into a processor's cache directly from the I/O bus. This disparity adversely affects the performance of memory bound appli- cations including certain scientific computations, encryp- tion, image processing, and some graphics applications. Cache injection can reduce memory latency and memory pressure for I/O. The performance of cache injection is de- pendent on several factors including timely usage of data, the amount of data, and the application's data usage pat- terns. We show that cache injection provides significant ad- vantages over data prefetching by reducing the pressure on the memory controller by up to 96%. Despite its benefits, cache injection may degrade application performance due to early injection of data. To overcome this limitation, we propose injection policies to determine when and where to inject data. These policies are based on OS, compiler, and application information.
An Analytical Framework and Its Applications for Studying Brick Storage Reliability
Authors: Ming Chen, Wei Chen, Likun Liu, Zheng Zhang
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

The reliability of a large-scale storage system is in-fluenced by a complex set of inter-dependent factors. This paper presents a comprehensive and extensible analytical framework that offers quantitative answers to many design tradeoffs. We apply the framework to a number of important design strategies that a designer and/or administrator must face in reality, including topology-aware replica placement, proactive replica-tion that uses small background network bandwidth and unused disk space to create additional copies. We also quantify the impact of slow (but potentially more accurate) failure detection and lazy replacement of failed disks. We use detailed simulation to verify and refine our analytical model. These results demonstrate the versatility of the framework and serve as a solid step towards more quantitative studies of fundamental system tradeoffs between reliability, performance, and cost in large-scale distributed storage systems.
Verifying and Validating Software Requirements and Design Specifications
Authors: B. W. Boehm
Venue: IEEE Software (1984)

These recommendation provide a good starting point for identifying and resolving software problems early in life cycle when they're s relatively easy to handle
On identity assurance in the presence of federated identity management systems
Authors: Yolanta Beres, Adrian Baldwin, Marco Casassa Mont, Simon Shiu
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

In this paper we address the appropriate management of risk in federated identity management systems by presenting an identity assurance framework and supporting technologies. We start by discussing the risk mitigation framework that should be part of any identity assurance solution. We then demonstrate how our model based assurance technologies can be used to report success of an identity assurance programme. We discuss how this approach can be used to gain trust within a federated identity management solution both by communicating the nature of the assurance framework and that risks are successfully being mitigated. Finally, we show the importance of automation of controls in easing operational costs (and we describe related approaches developed at HP Labs and PRIME project); providing improved audit information and changing the risk mitigation landscape.
Ada Tasking: From semantics to Efficient Implementation
Authors: T. P. Baker
Venue: IEEE Software (1985)

Tasking is one of the strengths of Ada, and, contrary to some opinion, can be implemented for a single shared processor by simple, straightforward, and efficient algorithms.
Energy Residue Aware (ERA) Clustering Algorithm for Leach-based Wireless Sensor Networks
Authors: Huan Chen, Cheng-Shong Wu, Yuan-Sun Chu, Chih-Chuan Cheng, Li-Kuang Tsai
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Many energy efficient routing protocols have been proposed in sensor networks for different scenarios and various applications in literature. One of the efficient way is to group sensors in the neighboring into clusters and send aggregate data by a designated cluster head. However, such design discipline still can not balance the energy consumption of the entire network. As such, in worst cases, some nodes may be soon exhausted. Consequently, it is difficult to provide effective operation and seamless coverage in such a network. In this paper, we propose a novel clustering associating algorithm, known as Energy Residue Aware (ERA) clustering algorithm, to prolong the lifetime of a sensor network by balancing the energy consumption of the entire network. ERA enables each sensor to associate its cluster head to find a path with maximum energy residue sum instead of a path with the minimum energy consumption. Simulations are conducted to evaluate the performance in terms of the network lifetime and energy distribution among nodes. Numerical results show that proposed ERA can maintain a balanced energy consumption distribution among nodes in a sensor network and thus prolong the network lifetime.
Non-Preemptive Min-Sum Scheduling with Resource Augmentation
Authors: Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Cliff Stein, Baruch Schieber
Venue: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (2007)

We give the first O(1)-speed O(1)-approximation polynomial-time algorithms for several nonpreemptive minsum scheduling problems where jobs arrive over time and must be processed on one machine. More precisely, we give the first O(1)-speed O(1)-approximations for the nonpreemptive scheduling problems 1\left| {rj} \right|\sum {w_j } F_j (weighted flow time), 1\left| {rj} \right|\sum {T_j } (total tardiness), the broadcast version of 1\left| {rj} \right|\sum {w_j } F_j, an O(1)-speed, 1-approximation for 1\left| {rj} \right|\sum {\bar U_j } (throughput maximization), and an O(1)-machine, O(1)-speed O(1)-approximation for 1\left| {rj} \right|\sum {w_j } T_j (weighted tardiness). Our main contribution is an integer programming formulation whose relaxation is sufficiently close to the integer optimum, and which can be transformed to a schedule on a faster machine.
A hot path based thread partitioning technique for thread pipelining model
Authors: Kanemitsu Ootsu, Takahiko Kobayashi, Hirohito Ogawa, Takashi Yokota, Takanobu Baba
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

We have developed a software system that can translate sequential binary codes to the multithreaded ones at the binary code level. This system parallelizes frequently executed loops within programs to improve the performance by exploiting loop-level parallelism for numerical application programs. However, many loops within nonnumerical application programs are hard to be parallelized because of their small amount of loop-level parallelism and complex program structures, and it is difficult to attain speed-up by exploiting loop-level parallelism. Therefore, it is necessary to generate multithreaded codes, taking more general program structure than loop structure within program into consideration. In this paper, we propose a thread partitioning technique of multithreaded execution along a hot path (the most frequently executed control sequence of basic blocks), taking more general program structure than loops into consideration. And we apply the proposed technique to three non-numerical application programs of SPEC CINT95 benchmark, and evaluate the performance improvement by simulation. The evaluation result shows that the proposed technique can improve the performance of non-numerical application program, whose performance cannot be improved by exploiting loop-level parallelism.
Sensor localization in concave environments
Authors: Chen Wang, Li Xiao
Venue: ACM Transactions on Sensor Networks (TOSN) (2008)

In sensor network localization, multihop based approaches have been proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approximation can be achieved when sensors are densely deployed in a convex area, where the shortest paths are close to straight lines connecting pairwise sensors. However, in a concave network, the shortest paths may deviate far away from straight lines, which leads to erroneous distance estimation and inaccurate localization results. To solve this problem, we propose an improved multihop algorithm that can recognize and filter out the erroneous distance estimation, and therefore achieve accurate localization results even in a concave network.