ppxscal/embedding_network huggingface dataset:
Introducing Executable Product Models for the Service Industry
Authors: Markus Kress, Joachim Melcher, Detlef Seese
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In these days, companies need highly flexible processes to deal with changing environments and competitors. Using traditional process models that have to be modeled in all details in advance, one gives up a considerable part of this flexibility. This paper presents a new approach for the information-intensive service industry, the executable product model (EPM), based on work done by van der Aalst et al. [9] that does not show this shortcoming. In an EPM, information dependencies are represented as graph. Implicitly, this graph models all possible processing sequences and alternative processing variants. An algorithm is presented that can execute EPMs preserving all information dependencies. A multi-agent system with two different negotiation protocols is used for resource allocation. A discrete event simulation shows the principal proof-of-concept. For several structurally different EPMs, the efficiency of both protocols is statistically compared.
Selfishness, Not Always A Nightmare: Modeling Selfish MAC Behaviors in Wireless Mobile Ad Hoc Networks
Authors: Lin Chen, Jean Leneutre
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

In wireless mobile ad hoc networks where nodes are selfish and non-cooperative, a natural and crucial question is how well or how bad the MAC layer protocol IEEE 802.11 DCF performs. In this paper, we study this question by modeling the selfish MAC protocol as a noncooperative repeated game where players follow the TITFOR- TAT (TFT) strategy which is regarded as the best strategy in such environments. We show for single-hop ad hoc networks the game admits a number of Nash Equilibria (NE). We then perform NE refinement to eliminate the inefficient NE and show that there exists one efficient NE maximizing both local and global payoff. We also propose an algorithm to approach the efficient NE. We then extend our efforts to multi-hop case by showing that the game converges to a NE which may not be globally optimal but quasioptimal in the sense that the global payoff is only slightly less than the optimal case. As conclusion, we answer the posed question by showing that selfishness does not always lead to network collapse. On the contrary, it can help the network operate at a NE globally which is optimal or quasi-optimal under the condition that players are long-sighted and follow the TFT strategy.
Quantitative stability analysis of optimal solutions in PDE-constrained optimization
Authors: Kerstin Brandes, Roland Griesse
Venue: Journal of Computational and Applied Mathematics (2007)

PDE-constrained optimization problems under the influence of perturbation parameters are considered. A quantitative stability analysis for local optimal solutions is performed. The perturbation directions of greatest impact on an observed quantity are characterized using the singular value decomposition of a certain linear operator. An efficient numerical method is proposed to compute a partial singular value decomposition for discretized problems, with an emphasis on infinite-dimensional parameter and observation spaces. Numerical examples are provided.
A probabilistic model for optimal insurance contracts against security risks and privacy violation in IT outsourcing environments
Authors: S. Gritzalis, A. N. Yannacopoulos, C. Lambrinoudakis, P. Hatzopoulos, S. K. Katsikas
Venue: International Journal of Information Security (2007)

Day by day the provision of information technology goods and services becomes noticeably expensive. This is mainly due to the high labor cost for the service providers, resulting from the need to cover a vast variety of application domains and at the same time to improve or/and enhance the services offered in accordance to the requirements set by the competition. A business model that could ease the problem is the development or/and provision of the service by an external contractor on behalf of the service provider; known as Information Technology Outsourcing. However, outsourcing a service may have the side effect of transferring personal or/and sensitive data from the outsourcing company to the external contractor. Therefore the outsourcing company faces the risk of a contractor who does not adequately protect the data, resulting to their non-deliberate disclosure or modification, or of a contractor that acts maliciously in the sense that she causes a security incident for making profit out of it. Whatever the case, the outsourcing company is legally responsible for the misuse of personal data or/and the violation of an individual&#x2019;s privacy. In this paper we demonstrate how companies adopting the outsourcing model can protect the personal data and privacy of their customers through an insurance contract. Moreover a probabilistic model for optimising, in terms of the premium and compensation amounts, the insurance contract is presented.
Exponential synchronization of stochastic perturbed chaotic delayed neural networks
Authors: Yonghui Sun, Jinde Cao, Zidong Wang
Venue: Neurocomputing (2007)

In this paper, we deal with the exponential synchronization problem for a class of stochastic perturbed chaotic delayed neural networks. Based on the Lyapunov stability theory, by virtue of stochastic analysis, Halanay inequality for stochastic differential equations, drive-response concept and time-delay feedback control techniques, several sufficient conditions are proposed to guarantee the exponential synchronization of two identical chaotic delayed neural networks with stochastic perturbation. These conditions, which are expressed in terms of linear matrix inequalities, rely on the connection matrix in the drive networks as well as the suitable designed feedback gains in the response networks. Finally, a numerical example with its simulations are provided to illustrate the effectiveness of the presented synchronization scheme.
Platform independent overall security architecture in multi-processor system-on-chip integrated circuits for use in mobile phones and handheld devices
Authors: A. Ashkenazi, D. Akselrod
Venue: Computers and Electrical Engineering (2007)

A platform independent security architecture for use in Multi-Processor System-on-Chip integrated circuits, primarily oriented for mobile phones and handheld devices, is presented. The suggested architecture provides an enhanced security protection scheme for use in smartphones, PDA's, as well as other similar systems. Sensitive data storage facilities, cryptographic engines, and physical protection mechanisms such as debug port access control are presented and described in detail. The proposed secure architecture has been incorporated as a part of an application processor which in turn is embedded in a number of smartphone and handheld products. System operation is discussed and hardware realization and experimental results of the proposed architecture are described.
NT security in an open academic environment
Authors: Gregg Daly, Gary Buhrmaster, Matthew Campbell, Andrea Chan, Robert Cowles, Ernest Denys, Patrick Hancox, Bill Johnson, David Leung, Jeff Lwin
Venue: Proceedings of the 2nd conference on Large Installation System Administration of Windows NT - Volume 2 (1999)

Stanford Linear Accelerator Center (SLAC) was faced with the need to secure its PeopleSoft/Oracle business system in an academic environment which only has a minimal firewall. To provide protected access to the database servers for NT-based users all over the site while not hindering the lab's open connectivity with the Internet, we implemented a pseudo three-tier architecture for PeopleSoft with Windows Terminal Server and Citrix MetaFrame technology. The client application and Oracle database were placed behind a firewall, and access was granted via an encrypted link to a thin client. Authentication in the future will be through two-factor token cards. NT workstations in the business system unit were further secured through switched network ports and an automated installation process that included SMB signing and disabling LM Authentication in favor of NTLMv2. The hardened workstations then accessed the business system through the Citrix Secure ICA client. How these security measures affected our mixed environment (Windows9x, Samba, Transarc AFS clients, Pathworks, developers, researchers) is discussed.
A graded process for basic electronic circuit design that works
Authors: N. Mohankrishnan
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Teaching electronic circuit design so that it "sticks" has to be a two-step instructional process that interleaves theoretical treatment with the use of Spice-based simulation techniques to attempt circuit synthesis very early on in the process. An instructional example demonstrating this is discussed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Beam-augmented space-time adaptive processing
Authors: Y. Seliktar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Combined monostatic clutter (MSC) and terrain scattered interference (TSI) pose a difficult challenge for adaptive radar processing. Mitigation techniques exist for each interference alone but are insufficient for their combined effects. Current approaches separate the problem into two stages where TSI is suppressed first and then MSC. The problem with this cascade approach is that during the initial TSI suppression stage, the MSC becomes corrupted. In this paper an innovative technique is introduced for achieving a significant improvement in cancellation performance for both MSC and TSI, even when the jammer appears in the mainbeam. The majority of the interference rejection, both TSI and MSC, is accomplished with an MSC filter, with further TSI suppression accomplished via an additional tapped reference beam. Simultaneous optimization of the MSC filter weights and reference beam weights yields the desired processor. Performance results using Mountain-top data demonstrate the superiority of the proposed processor over existing processors.
Remote wiring and measurement lab [electronic engineering education]
Authors: R. Tanner
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This paper describes a system composed of hardware and software to allow an individual to create an electronic circuit using a Web interface. The user interface would simulate an electronic breadboard, such as students usually use in a typical undergraduate electronics lab. A matrix of relays would allow the actual components to be connected in any manner that the user specifies over the web. In this way, a user will be able to remotely wire up a variety of circuits and take measurements without needing to physically be in the laboratory.
System level assessment of an optical NoC in an MPSoC platform
Authors: M. Brière, B. Girodias, Y. Bouchebaba, G. Nicolescu, F. Mieyeville, F. Gaffiot, I. O'Connor
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In the near future, Multi-Processor Systems-on-Chip (MPSoC) will become the main thrust driving the evolution of integrated circuits. MPSoCs introduce new challenges, mainly due to growing communication through their interconnect structure. Current electrical interconnects will face hard challenges to overcome such data flows. Integrated optical interconnect is a potential technological improvement to reduce these problems. The main contributions of this paper are i) the optical network integration in a system-level MPSoC platform and ii) the quantitative evaluation of optical interconnect for MPSoC design using a multimedia application.
Self Checking Circuit Optimization by means of Fault Injection Analysis: A Case Study on Reed Solomon Decoders
Authors: S. Pontarelli, L. Sterpone, G. C. Cardarilli, M. Re, M. Sonza Reorda, A. Salsano, M. Violante
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

This paper shows how the use of exhaustive fault injection campaigns in conjunction with the analysis of the property of a circuit, allows to improve the efficiency of the checker of self checking circuits. Experimental results coming from fault injection campaigns on a Reed-Solomon Decoder demonstrated that by observing the occurred errors and the correspondent detection module has been possible to reduce the number of detection module, while paying a small reduction of the percentage of SEUs that can be detected.
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
Authors: Franck Cassez, Stavros Tripakis, Karine Altisen
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists of synthesizing a diagnoser that observes a given plant and identifies faults in the plant as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider static as well as dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe.
Windows XP kernel crash analysis
Authors: Archana Ganapathi, Viji Ganapathi, David Patterson
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

PC users have started viewing crashes as a fact of life rather than a problem. To improve operating system dependability, systems designers and programmers must analyze and understand failure data. In this paper, we analyze Windows XP kernel crash data collected from a population of volunteers who contribute to the Berkeley Open Infrastructure for Network Computing (BOINC) project. We found that OS crashes are predominantly caused by poorly-written device driver code. Users as well as product developers will benefit from understanding the crash behaviors elaborated in this paper.
A Fuzzy Genetic Clustering Technique Using a New Symmetry Based Distance for Automatic Evolution of Clusters
Authors: Sriparna Saha, Sanghamitra Bandyopadhyay
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In this paper a fuzzy point symmetry based genetic clustering technique (Fuzzy-VGAPS) is proposed which can determine the number of clusters present in a data set as well as a good fuzzy partitioning of the data. A new fuzzy cluster validity index, FSym-index, which is based on the newly developed point symmetry based distance is also proposed here. FSym-index provides a measure of goodness of clustering on different fuzzy partitions of a data set. Maximum value of FSym-index corresponds to the proper clustering present in a data set. The flexibility of Fuzzy-VGAPS is utilized in conjunction with the fuzzy FSym-index to determine the number of clusters present in a data set as well as a good fuzzy partition of the data. The results of the fuzzy VGAPS are compared with those obtained by fuzzy version of variable string length genetic clustering technique (Fuzzy-VGA) optimizing XB-index. The effectiveness of the Fuzzy-VGAPS is demonstrated on four artificial data sets and two real-life data sets.
A Virtual Node-Based Tracking Algorithm for Mobile Networks
Authors: Tina Nolte, Nancy Lynch
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, consisting of mobile clients, virtual timed machines distributed at known locations in the plane, called virtual stationary automata (VSAs), and a communication service connecting VSAs and mobile clients. VINESTALK maintains a data structure on top of an underlying hierarchical partitioning of the network. In a grid partitioning, operations to find a mobile object distance d away take O(d) time and communication to complete. Updates to the tracking structure after the object has moved a total of d distance take O(d . log network diameter) amortized time and communication to complete. The tracked object may relocate without waiting for VINESTALK to complete updates for prior moves, and while a find is in progress.
Book Reviews
Authors: Bob O’Malley
Venue: SIAM Review (2007)

I&rsquo;m very grateful to board member Arieh Iserles for writing a featured review of Donald Knuth&rsquo;s latest fascicle of Volume 4 of The Art of Computer Programming: Generating All Trees. Arieh wrote this on short notice, since the designated reviewer of another important feature selection failed to deliver. Though book reviewers, no doubt for a variety of good reasons, sometimes don&rsquo;t do their job in a timely manner, this is the first time in memory that a featured review didn&rsquo;t materialize, even through extended deadlines. The situation makes us realize how fortunate we are to have so many loyal and conscientious reviewers. Thanks very much to all of you. In addition to combinatorics, this issue features books in mathematical biology, software, fluid and solid mechanics, probability and statistics, differential equations, pure and applied geometry, analysis, and even the history of mathematics.
Pervasive computing in the domestic space
Authors: Steve Howard, Jesper Kjeldskov, Mikael B. Skov
Venue: Personal and Ubiquitous Computing (2007)

Information and computing technologies have gone wild; broken free as servants of organizational ends and launched off the desktop, computing artefacts are finding new forms, new rationales and new circumstance of use. In some cases this change is purposeful and deliberate, but in others an intriguing socio-technical drift is at work, and the influences over that drift are yet to be understood. Here, we surface four interrelated dimensions along which transformation is occurring (technology, context, users and purposes), and we commence a discussion aiming to articulate both the visible and the unremarked upon influences over that drift.
Nonintrusive Black- and White-Box Testing of Embedded Systems Software against UML Models
Authors: Philipp Graf, Klaus D. Muller-Glaser, Clemens Reichmann
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

We extend a model based development approach for software components of embedded systems by a model based testing framework. We motivate by describing challenges a developer has to face when developing embedded software and present as a solution an UML-centric development approach. We introduce a testing framework that allows specification of test cases for UML class models using UML sequence- and use-case-diagrams. These test cases define participating objects and their messages including parameters, loops, control structures, inclusion of other collaborations and time constraints. These diagrams are verified against the real system-response of the software under test. We employ a commercial in-circuit emulator to record method calls, object identities and their parameters on C source-code level as messages with minimal impact on system performance and map these back to model level to verify them against the specified model.
Fast knock detection using pattern signals
Authors: S. Carstens-Behrens
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In order to detect knock in spark ignition engines, usually structure-borne sound signals measured by acceleration sensors mounted on the engine housing are analyzed. Earlier investigations have shown that using linear, time variant filtered structure-borne sound signals as an approximated pressure signal instead improves knock detection significantly. But this method is computationally too expensive for application in production vehicles. We propose to fit suitable pattern signals to structure-borne sound and use the estimated scaling parameters to approximate pressure. The new approach is applied to knock detection with measured data.
Scenarios and Middleware Services for Pervasive Multiplatform Networked Games
Authors: Fernando Trinta, Davi Pedrosa, Carlos Ferraz, Geber Ramalho
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

This work in progress paper presents a particular view for future Networked Multiplayer Games. In our point of view, these applications will include features from pervasive computing, allowing players to enjoy them using different devices, such as PDAs and Mobile Phones, almost anywhere, anytime. These games demand that the way each player interacts with the game must be adapted according to their context information, such as players location and device. In this document, we call these applications Pervasive Multiplayer Multiplatform Games (PM2G). We present scenarios that show intended characteristics for these games. Based on requirements extracted from our scenarios, we also propose five services that aims at allowing PM2G's development and deployment.
DCT-based subpixel motion estimation
Authors: Ut-Va Koc
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Inter-pixel interpolation is required for most subpixel motion estimation schemes but it undesirably increases the overall complexity and data flow and deteriorates the estimation accuracy. We develop DCT-based techniques to estimate subpel motion at different desired levels of accuracy in the DCT domain without interpolation by establishing subpel sinusoidal orthogonal principles and showing that subpixel motion information is preserved in the DCT of a shifted signal under some conditions in the form of pseudo phases. Though applicable to other areas, the resulting algorithms from these techniques for video coding are flexible and scalable with very low complexity O(N/sup 2/) compared to O(N/sup 4/) for block matching methods. Importantly, DCT-based methods enable simplification of the heavily loaded feedback loop of conventional hybrid video coder design, resulting in a high-throughput, low-complexity fully DCT-based coder. Finally, simulation results show a comparable performance of the proposed algorithms with block matching methods.
Software Engineering for Automotive Systems: A Roadmap
Authors: Alexander Pretschner, Manfred Broy, Ingolf H. Kruger, Thomas Stauner
Venue: 2007 Future of Software Engineering (2007)

The first pieces of software were introduced into cars in 1976. By 2010, premium class vehicles are expected to contain one gigabyte of on-board software. We present research challenges in the domain of automotive software engineering.
Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity
Authors: Kimikazu Kato, Hiroshi Imai, Keiko Imai
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Numerical estimation of quantum channel capacity is an important problem both theoretically and practically. Oto et al. showed an effective approximation algorithm to compute a capacity of a one-qubit quantum channel. In this paper, we show an explicit upper bound for the error of their algorithm. The algorithm might be repeatedly used in the verification of a certain equation or inequality. The bound of the error we give is a criterion to decide when to stop that iteration, and eventually it can improve the performance of the whole process of the calculation.