ppxscal/embedding_network huggingface dataset:
Adaptive Global Integral Neuro-sliding Mode Control for a Class of Nonlinear System
Authors: Yuelong Hao, Jinggang Zhang, Zhimei Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

An scheme of composite sliding control is proposed for a class of uncertainty nonlinear system, which is based on fuzzy neural networks (FNN) and simple neural networks (SNN). The SNN is uniquely determined by the design of the global integral sliding mode surface, the output of which replaces the corrective control, and FNN is applied to mimic the equivalent control. In this scheme, the bounds of the uncertainties and the extern disturbance are not required to be known in advance, and the stability of systems is analyzed based on Lyapunov function. Simulation results are given to demonstrate the effectiveness of this scheme.
A Toolkit for Visualizing the Runtime Behavior of TinyOS Applications
Authors: Andrew R. Dalton, Jason O. Hallstrom
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

TinyOS has proven to be an effective platform for developing reactive embedded network applications. However, the platform's lean programming model and power-efficient operation come at a price: TinyOS applications are notoriously difficult to construct and debug. The development difficulties stem, in large part, from a programming model founded on events and deferred execution. In short, the model introduces non-determinism in the execution ordering of primitive actions (i.e., commands, events, and tasks). The resulting set of possible execution sequences is typically large, and can swamp developers' unaided intellectual ability to reason about program behavior. In this paper, we present a platform-neutral visualization toolkit for TinyOS 2.0 to aid in program comprehension. The goal is to assist developers in reasoning about the computation forest underlying a system under test, and the particular branches chosen during each run. The toolkit design includes (i) a full-featured static analysis and instrumentation library, (ii) a selection-based probe insertion system, (iii) a lightweight event recording service, (iv) a trace extraction and reconstruction tool, and (v) two visualization front-ends. We demonstrate the utility of the toolkit using standard system examples, and present an analysis of the toolkit's resource usage and performance characteristics.
Prologue: The Burroughs B 5000
Authors: Robert F. Rosin
Venue: IEEE Annals of the History of Computing (1987)

This issue of the Annals is devoted to the history of the B 5000 mainframe system. Twenty-five years ago the B 5000 was considered by many people to be a radical departure from the traditional computer system design of that time. In many ways the design of this system and its successors is still recognized as not only pioneering but exceptional.
Using Automated Planning for Trusted Self-organising Organic Computing Systems
Authors: Benjamin Satzger, Andreas Pietzowski, Wolfgang Trumler, Theo Ungerer
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

The increasing complexity of computer-based technical systems require new ways to control them. The initiatives Organic Computing and Autonomic Computing address exactly this issue. They demand future computer systems to adapt dynamically and autonomously to their environment. In this paper we propose a new approach based on automated planning to realise self-organising capabilities for complex distributed computing systems. The user/administrator only defines objectives describing the conditions which should hold in the system, whereas the system itself is responsible for meeting them using a planning engine. As many planning algorithms are known to be sound and complete, formal guarantees can be given. Thus we aim at building trusted self-organising distributed computer system which are suitable to control real technical systems. Our approach is demonstrated and evaluated on the basis of a simulated production cell with robots and carts. We propose and evaluate two optimisations.
Development of Artificial Neural Networks-Based In-Process Flash Monitoring (ANN-IPFM) System in Injection Molding
Authors: Joseph Chen, Mandara Savage, Jie (James) Zhu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper describes the development of an artificial neural networks-based in-process flash monitoring system (ANN-IPFM) in the injection molding process. This proposed system integrates two sub-systems. One is the vibration monitoring sub-system that utilizes an accelerometer sensor to collect and process vibration signals during the injection molding process. The other, a threshold prediction sub-system, predicts a control threshold based on the process parameter settings, thus allowing the system to adapt to changes in these settings. The integrated system compares the monitored vibration signals with the control threshold to predict whether or not flash will occur. The performance of the ANN-IPFM system was determined by using varying ratios of polystyrene (PS) and low-density polyethylene (LDPE) in the injection molding process, and comparing the number of actual occurrences of flash with the number of occurrences predicted by the system. After a 180 trials, results demonstrated that the ANN-IPFM system could predict flash with 92.7% accuracy.
Convergence and stability of iterative algorithm for a new system of (A,η)-accretive mapping inclusions in Banach spaces
Authors: Mao-Ming Jin
Venue: Computers Mathematics with Applications (2008)

In this paper, we introduce and study a new system of (A,@h)-accretive mapping inclusions in Banach spaces. Using the resolvent operator associated with (A,@h)-accretive mappings, we suggest a new general algorithm and establish the existence and uniqueness of solutions for this system of (A,@h)-accretive mapping inclusions. Under certain conditions, we discuss the convergence and stability of iterative sequence generated by the algorithm. Our results extend, improve and unify many known results on variational inequalities and variational inclusions.
Performance modeling and analysis of correlated parallel computations
Authors: Wei-Ming Lin
Venue: Parallel Computing (2008)

A performance analysis methodology for correlated parallel computations based on statistical theory is proposed. Divide-and-conquer strategy is widely used in solving problems in parallel by partitioning and allocating a number of given tasks to available computing resources. When the tasks exhibit run-time-dependent behaviors during execution and share a universal distribution function in their execution times, analysis of parallel execution time can be performed with the assistance of probabilistic and statistical models. Correlation (dependence) in execution times among tasks has posed a significant factor in influencing the analysis accuracy which is unmanageable by any known analysis methodologies. We establish a relation between a task's or a processor's execution time and the parallel execution time, in terms of expected value as well as variance when each task's execution time can be closely modeled by a normal distribution, for either uncorrelated or correlated tasks. This relation is then applied to the modeling and analysis of various parallel computation paradigms in which different communication and synchronization patterns along the processing are present. The method proposed has a wider application scope and gives more accurate prediction results than previously known approaches. We also show that, as an extended application of the analysis method to a large scope of problems, load balance among processors can be vastly improved with some novel static task allocation technique in manipulating the correlation among tasks. Experimental results in analyzing a parallel tree search algorithm and two parallel sorting algorithms show very accurate analysis and prediction with the proposed method.
Internal models and private multi-agent belief revision
Authors: Guillaume Aucher
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the single-agent case, based on the notion of interpretation, to the multi-agent case. Then we show that, thanks to the shape of our new semantics, all the results of the AGM framework transfer. Afterwards we investigate some postulates that are specific to our multi-agent setting.
A model for evaluating a design change and the distributed manufacturing operations in a collaborative manufacturing environment
Authors: Yuan-Jye Tseng, Yu-Wen Kao, Feng-Yi Huang
Venue: Computers in Industry (2008)

The purpose of a design change is to modify a portion of a product for certain improvement purposes such as adding values or reducing costs. A design change of one component may cause changes of the related components and the associated manufacturing operations that are distributed at different plants. In a collaborative manufacturing environment, the manufacturing operations distributed at the multiple plants need to be rearranged for producing the changed product. In this research, the effect of a design change is analyzed by evaluating the affected components and the distributed manufacturing operations from a cost-and-value perspective. A mathematical programming model is presented to evaluate the changed components by distributing the associated manufacturing operations with an objective of minimizing the total manufacturing cost. The changed total manufacturing cost is compared with the gained value to determine the worth value of the design change case. The presented model is useful for analyzing the effect of a design change case in a collaborative manufacturing environment. Implementation and test result of an example product are presented and discussed.
A dynamic layer management scheme for a superpeer ring with a loosely-consistent DHT
Authors: Saeyoung Han, Sungyong Park
Venue: International Journal of Communication Networks and Distributed Systems (2008)

In this paper we propose a Dynamic Layer Management (DLM) scheme for a self-organising superpeer ring with a loosely-consistent DHT. Each peer estimates the global capacity based on the information collected by mobile agents and autonomously decides whether it can be a superpeer or not. The proposed scheme also changes the size of the superpeer ring adaptively according to the size of the network, and maintains an appropriate number of superpeers in dynamic peer-to-peer environments. The benchmarking results show that our scheme outperforms the fixed superpeer system in terms of search latency at the expense of message overhead added for the DLM.
Formalisms in Software Engineering: Myths Versus Empirical Facts
Authors: Dieter Rombach, Frank Seelisch
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

The importance of software grows in all sectors of industry and all aspects of life. Given this high dependability on software, the status of software engineering is less than satisfactory. Accidents, recall actions, and late projects still make the news every day. Many of the software engineering research results do not make it into practice, and thereby the gap between research and practice widens constantly. The reasons for not making it into practice range from isufficient commitment for professionalization of software development on the industrial side, to insufficient consideration for practical scale-up issues on the research side, and a tremendous lack of empirical evidence regarding the benefits and limitations of new software engineering methods and tools on both sides. The major focus of this paper is to motivate the creation of credible evidence which in turn will allow for less risky introduction of new software engineering approaches into practice. In order to overcome this progress hindering lack of evidence, both research and practice have to change their paradigms. Research needs to complement each promising new software engineering approach with credible empirical evidence from in vitro controlled experiments and case studies; industry needs to baseline its current state of the practice quantitatively, and needs to conduct in vitro studies of new approaches in order to identify their benefits and limitations in certain industrial contexts.
Integrated Session Control for Peer-to-Peer IPTV Services
Authors: Seungchul Park
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Today's wide deployment of broadband access networks, high development of personal multimedia processing technologies, and high interests in UCC(User Created Content)s are pushing the P2P (Peer to Peer) IPTV era to be opened in near future. The P2P IPTV will create a new paradigm for the Internet services. This paper proposes an integrated session control model for the P2P IPTV services and presents the IPTV session control procedures based on the proposed model. The proposed session control model allows the constituent TPS (Triple Play Services) of the P2P IPTV to be controlled in an integrated way. And it enables the QoS (Quality of Service) requirements of the P2P IPTV services to be appropriately controlled within a session so that the IPTV traffic can be handled in a differentiated way from the conventional Internet access traffic even in case of network congestion. It also incorporates the multicast control services so as to support effective transmission of video broadcasting streams. The proposed P2P IPTV session control model is designed to be based on the standard SIP (Session Initiation Protocol), IGMP (Internet Group Management Protocol), and COPS (Common Open Policy Services) protocol. The session control procedures presented in this paper show how the protocols are integrated to support the required session control services for the P2P IPTV.
Reliability in underwater inter-vehicle communications
Authors: Amrita A. Nimbalkar, Dario Pompili
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

Underwater networks are envisioned to enable several applications for oceanographic data collection, environmental monitoring, navigation, and tactical surveillance. Underwater acoustic networking is the enabling technology for these applications. Most of these applications make use of underwater vehicles and rely on inter-vehicle communication capabilities for information exchange and coordination purposes. Reliable data delivery, especially in the case of mobile underwater vehicles, is therefore a major concern in many of these applications. In this paper, three versions of a reliable unicast protocol are proposed, which integrate MAC and routing functionalities and leverage different levels of neighbor knowledge for making optimum decisions for reliable data delivery. The different levels of neighbor knowledge used by the protocols are: (i) no neighbor knowledge, (ii) one-hop neighbor knowledge, and (iii) two-hop neighbor knowledge. The three versions of the protocol have been devised by considering the peculiar characteristics of underwater channel, in design as well as in performance simulation. The protocols have been compared in static as well as mobile scenarios in terms of different end-to-end networking metrics.
Nitrogen impurity effects on nickel silicide formation at low temperatures - New "nitrogen co-plasma" approach
Authors: B. Imbert, M. Gregoire, S. Zoll, R. Beneyton, S. Del-Medico, C. Trouiller, O. Thomas
Venue: Microelectronic Engineering (2008)

Nickel based silicide films were prepared by annealing nickel-platinum layers deposited on n doped Si substrates. We report on the evolution of the phase formation and the redistribution of contaminants on blanket wafers during silicide formation as a function of the nitrogen gas flow introduces during Ni(Pt) deposition. Nitrogen incorporation creates a contamination as-deposited layer which modifies phase formation and changes nickel diffusion. Nitrogen is not incorporated in silicide formed. After a second anneal, the monosilicide forms excepted for high nitrogen quantity introduced where the Ni"3Si"2 is always observed. Monosilicide thermal stability is also improved by nitrogen co-plasma.
OFFH-CDMA merged M-sequence/hyperbolic code for two weights one length WDM system
Authors: Ferchichi Moez, Najjar Monia, Rezig Houria
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

In this paper, we propose an extension of two dimensions (2D) code cardinality for slightly the same performance (BER). The code, developed for optical code division multiple access (OCDMA) system is generated by: hyperbolic code for the Time Spreading and merged M-sequences for the Frequency-Hopping, in this work we consider the Optical Fast Frequency Hopping technique (OFFH). For the families codes we apply the constraint of cross-correlation which is equal to one in order to decrease the Multiple Access Interference (MAI). The frequency spacing is selected according to WDM standardization. Optical delay lines and Fiber-Bragg gratings (FBG) are the elements constituting the encoder/decoder utilized to generate/decode the code words. For the same transmission rate (the same code length), compared with the 2D code employing prime code for the time spreading, the extension will increase the cardinality to P(P-1)2 users (proposed code) than P2 users (comparison code) for a given optical LAN code words group and two qualities of service (QoS) are proposed rather than one.
An adaptive volume constraint algorithm for topology optimization with a displacement-limit
Authors: Chyi-Yeu Lin, Fang-Ming Hsu
Venue: Advances in Engineering Software (2008)

This paper proposes a novel adaptive volume constraint algorithm (AVC) to replace the fixed volume constraint (FVC) in the traditional topology optimization method, such that a minimum-compliance optimal structure that simultaneously meets the additional displacement limit can be searched. Optimal minimum-compliance structures are subject to the limit of a predetermined amount of material in traditional calculation methods, and often fail to meet practical stress and displacement constraints, or become unnecessarily strong. Without displacement sensitivities, the AVC algorithm iteratively adjusts allowable material usage based on the difference between the actual displacement, and the allowable displacement limit. In this way, topology optimization can efficiently construct a minimum-compliance structure that meets the allowable displacement limit. The regular volume constraint algorithm (RVC), which slightly changes the volume constraint each time at the end of FVC, is also executed in order to demonstrate the advantages of the AVC algorithm. The effectiveness of the AVC algorithm is demonstrated by two illustrative 2-D design problems: a cantilever beam and a simple beam.
Biometric tendency recognition and classification system: an artistic approach
Authors: Carlos Castellanos, Philippe Pasquier, Luther Thie, Kyu Che
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The Biometric Tendency Recognition and Classification System is a software application that continuously measures a participant's physiological responses to a given image and runs a statistical classification algorithm on the measured data that then classifies the participant into one of four categories: passive, aggressive, loyal and subversive. The system is part of an interactive art project that explores issues of authority, privacy and security in relation to biometric technologies. In this paper, we demonstrate the development of this system that exemplifies the use of biometrics within the context of art.
Electron tube and crystal diode experience in computing equipment
Authors: J. A. Goetz, H. J. Geisler
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

Three years ago, the first Conference on Electron Tubes for Computers was held in Atlantic City. At that meeting a paper of similar title was presented, outlining field experience with electron tubes employed in widely used IBM products. Data prepared at the time illustrated common causes and frequency of tube failure, as determined by laboratory analysis and statistics maintained on field replaced components. The program from which this data evolves is continuous, and since its inception in early 1949, has provided a substantial reduction in field tube failures. In some instances, improvement in machine performance has resulted from the introduction of newly developed tube types, and in others from corrections made in misapplication of existing tubes. It is the purpose of this paper to outline the program of component improvement phases of computer manufacturing.
Folk Reducibility and AI-Complete Problems
Authors: Randy Goebel
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

The idea of an "AI-complete" problem has been around since at least the late 1970s, and refers to the more formal idea of the technique used to confirm the computational complexity of NP-complete problems. In the more formal context, the technique of reducibility was used to transform one problem into another that had already been proved to be NP-complete.Our presentation takes a closer look at what we call "Folk Reducibility", as an approximation to reducibility, in order to try and improve coherence regarding what constitutes tough AI problems. We argue that the traditional AI-complete problems like "the vision problem" and "the natural language problem" are too vague. We provide examples of more precisely specified problems, and argue that relationships amongst them provide a little more insight regarding where and how valuable problem relationships might emerge.
Cut Sequence Set Generation for Fault Tree Analysis
Authors: Dong Liu, Weiyan Xing, Chunyuan Zhang, Rui Li, Haiyan Li
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

For a fault tree, especially for a dynamic fault tree, the occurrence of top event depends on not only the combination of basic events, but also on the occurrence order of basic events. Cut sequence is a set of basic events that fail in a particular order that can induce top event. Cut sequence set (CSS) is the aggregate of all cut sequences in a fault tree. The paper puts forward an algorithm, named CSSA (CSS Algorithm), to generate the CSS of a fault tree. CSSA uses sequential failure symbol (SFS) to describe the sequential failure relationship between two events. And then, cut sequence can be expressed by sequential failure expression (SFE), which is a chain of basic events connected by SFSs. In order to get the CSS, SFS transformation is applied to static gates and dynamic gates, the result of which is reconstructed to the standard form of CSS according to the inference rules of SFE. At length, an example is used to illustrate the detailed processes of the approach. CSSA provides a new qualitative method that extends the existing fault tree analysis models.