ppxscal/embedding_network huggingface dataset:
Linux system management via XLink
Authors: Tseng-Chang Yen, Shang-Juh Kao, Felix Hsu
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

One of the reasons a user is willing to run a Linux server is because of its reliability and stability. Linux has historically been used mainly as a server system, and most operations are performed under command-line interface. Due to the numerous complicated Linux administrative commands, the threshold of efficient system management becomes extremely high. As XML is becoming an Internet standard for data representation and exchange, more and more applications and data files are tagged with XML format. In this paper, we show how the console-only menu system can be applied by remote access and how the menu system can be equipped with add-on information. To show how the XLink can effectively simplify the complicated administrative tasks, XLink-based system management applications of running kernel parameters changing and remote package installation are demonstrated.
Rough Algebras and Fuzzy Logic Algebras
Authors: Xiao-hong Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Rough Nelson algebras (rough sets systems) and UL*- algebras arose in two rather different fields: rough sets and fuzzy sets. In present paper, a pair of implication operator ( L, G) is introduced using the method by G. Cattaneo and D. Ciucci, and the relationship between rough Nelson algebras (rough sets systems) and UL*- algebras is established as following: the rough nelson algebras (rough sets systems) with ( L, G) make a UL*- algebras. Moreover, some properties of semi-simple Nelson algebra are investigated.
Commercial use of database technology
Authors: Harald Schöning
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

This session provides insight into two different European products for the E-commerce/database market. First, Martin Meijsen, Software AG, gives an overview on Tamino, Software AG's XML DBMS while the second presentation by Eva Kühn of TECCO AG, Austria discusses technical details of products that provides "zero-delay access to data warehouses",
Concept Index for Document Retrieval with Peer-to-Peer Network
Authors: Wenhui Ma, Wenbin Fang, Gang Wang, Jing Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Traditionally, full text retrieval over structure peer-to- peer network has been implemented by inverted index by keywords. However, search based on this index scheme only support literally word match, not taking into account the meaning of words. In this paper, we present a new index scheme, inverted index by concepts, for document retrieval over structure P2P network. We introduce ontology to capture the semantic relations between words, which provide a solution for ambiguity and richness of natural language. The index scheme proposed in this paper transforms the keyword search to the match process of concepts, and implementing keyword search based on semantic. Our index scheme also avoids the intersection of inverted lists between nodes when executing multi-keyword search. Simulation experiment shows that search based on our index scheme has higher retrieval performance than that based on keyword index, and generates lower network traffic.
Classic Paxos vs. fast Paxos: caveat emptor
Authors: Flavio Junqueira, Yanhua Mao, Keith Marzullo
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

Classic Paxos and Fast Paxos are two protocols that are the core of efficient implementations of replicated state machines. In runs with no failures and no conflicts, Fast Paxos requires fewer communication steps for learners to learn of a request compared to Classic Paxos. However, there are realistic scenarios in which Classic Paxos has a significant probability of having a lower latency. This paper discusses one such scenario with an analytical comparison of the protocols and simulation results.
Preparing IAS graduates to recognize and manage complexity
Authors: Steven Rigby, Melissa J. Dark, J. Ekstrom, Marcus Rogers
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Graduates entering the field of Information Assurance and Security (IAS) will be faced with many complex, ill-defined challenges. To be successful, IAS professionals will need to be able to solve complex, ill-defined problems that reflect the nature of the security risks, threats, and vulnerabilities that await them. Hence, a significant challenge facing educators is how to prepare professionals to recognize and manage complexity. Frequently, class assignments and problem activities are selected without complete understanding regarding the efficacy of the activities to increase students' understanding of the principles being taught. This paper will examine attributes of complex problems in the context of information assurance and security and proceed to analysis of how to teach complexity in IAS.
Probabilistic Model-Checking Support for FMEA
Authors: Lars Grunske, Robert Colvin, Kirsten Winter
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Failure Mode and Effect Analysis (FMEA) is a method for assessing cause-consequence relations between component faults and hazards that may occur during the lifetime of a system. The analysis is typically time intensive and informal, and for this reason FMEA has been extended with traditional model checking support. Such support does not take into account the probabilities associated with a component fault occurring, yet such information is crucial to developing hazard reduction strategies for a system. In this paper we propose a method for FMEA which makes use of probabilistic fault injection and probabilistic model checking. Based on this approach safety engineers are able to formally identify if a failure mode occurs with a probability higher than its tolerable hazard rate.
Ada for the Intel 432 Microcomputer
Authors: S. Zeigler
Venue: Computer (1981)

Ada represents a new era in language standards and software portability. It is the primary language of Intel's new micromainframe, which directly supports many of its features.
Context-based Dynamic Channel Management for Efficient Event Service in Pervasive Computing
Authors: Young Kwon You, Seungwok Han, Sung Keun Song, Hee Yong Youn
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In pervasive computing environment a number of distributed applications asynchronously exchange data using the event-based mechanism. The OMG defined CORBA Event Service for asynchronous messaging, which provides a flexible channel for asynchronous communication among the distributed and collocated objects. In the existing Event Service channels are created manually by the developers or users to process and disseminate the events. Also, the channel management is static which may cause bottleneck in some channels. In this paper, thus, we propose a dynamic context-based channel management scheme by efficiently combining name service with event service. It is embedded in the CALM(Componentbased Autonomic Layered Middleware) developed by us, which has been implemented based on ORB. Computer simulation reveals that the proposed approach significantly reduces the event delivery and processing time of the existing omni Event Service and TIBCO.
Error Analysis of Certain Floating-Point On-Line Algorithms
Authors: O. Watanuki
Venue: IEEE Transactions on Computers (1983)

The properties of redundant number system in significand (mantissa) representation are studied and the range of redundant significand is derived. From the range of the redundant significand and the absolute error of on-line operations, the MRRE (maximum relative representation error) is defined and analyzed for floating-point on-line addition and multiplication.
Cluster-Based Minimum Mean Square Estimation for Secure and Resilient Localization in Wireless Sensor Networks
Authors: Cliff Wang, An Liu, Peng Ning
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

To support a wide variety of applications ranging from military surveillance to health care clinic monitoring, a wireless sensor network must obtain accurate location for each sensor. A number of localization schemes have been developed to allow each sensor node to acquire its location. However, most of these techniques assume benign environments, and thus cannot survive malicious attacks in hostile environments where external and/or compromised nodes may launch attacks. This paper proposes a new computationally efficient and resilient localization scheme based on the clustering of benign location reference anchors. Moreover, this paper reports both simulation and field experiments using a test-bed of MICAz motes performed to compare the proposed approach with several recent secure localization schemes. The experimental results demonstrate that the proposed scheme has the fastest execution time among all resilient localization schemes that can be used for the current generation of sensor platforms (e.g., MICA series of motes).
Creative students: what can we learn from them for teaching computer science?
Authors: Ralf Romeike
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

Supporting creativity is a learning objective in general school education. In computer science the creation of products plays an important role. We want to find out the impact of creative action in computer science education classes on task motivation and understanding of computer science concepts. Underlying elements and environments of the creative process are analyzed by interviewing creative students. First results indicate creativity as an important factor for motivation. Furthermore the use of a concept we call "building blocks" helps to achieve creative products.
Run-time adaptive on-chip communication scheme
Authors: Mohammad Abdullah Al Faruque, Thomas Ebi, Jörg Henkel
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

During run-time varying workloads and/or constraints in embedded systems require run-time adaptivity to provide a high degree of efficiency during any operation mode/scenario. Design time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. We are presenting the first approach of an adaptive on-chip communication scheme. It provides an adaptive routing/path allocation algorithm to meet a required level of QoS (guaranteed bandwidth). In our architecture adaptive runtime links are established by re-assigning buffer blocks on-demand. This adaptive buffer allocation scheme increases the buffer utilization and decreases the overall buffer use on an average of 42% in our case study analysis compared to a fixed buffer assignment strategy. The area overhead introduced by the adaptive scheme can be traded-off against the flexibility in order to select an available path and on-demand buffer allocation. We demonstrate the advantage by using various real world digital media applications and compare our approach to the state-of-the-art static on-chip communication schemes.
Parallel Task Execution in a Decentralized System
Authors: M. J. Gonzalez
Venue: IEEE Transactions on Computers (1972)

The overhead involved in the real-time multiprocessor execution of parallel-processable segments of a sequential program is investigated. The execution follows a preprocessing phase in which the source program is analyzed and the parallel-processable segments are recognized. A number of representations of a parallel-processable program are possible. A table representation is used, and a technique is developed to efficiently interpret this table in a system in which a number of identical processors share a common memory.
A New Approach to 3D Shape Blending
Authors: Huichun Hua, Gendai Gu, Tao Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In the present paper, a new point of 3D shape blending is discussed by considering the blending of smooth surfaces and rough surfaces. A unified model for approximating smooth or rough surfaces defined in the triangular field is first introduced, the model is chosen as the intrinsic feature of surfaces, an interpolation algorithm based on this model is then presented, and the simulation results show that the blending sequence is natural and satisfactory.
Assessing the Effectiveness of a Distributed Method for Code Inspection: A Controlled Experiment
Authors: Andrea De Lucia, Fausto Fasano, Genoveffa Tortora, Giuseppe Scanniello
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

We propose a distributed inspection method that tries to minimise the synchronous collaboration among team members to identify defects in software artefacts. The approach consists of identifying conflicts on the potential defects and then resolving them using an asynchronous discussion before performing a traditional synchronous meeting. This approach has been implemented in a web based tool and assessed through a controlled experiment with master students in Computer Science at the University of Salerno. The tool presented provides automatic merge and conflict highlighting functionalities to support the inspectors during the pre-meeting refinement phase and provides the moderator with information about the inspection progress as a decision support. The tool also supports a synchronous inspection meeting to discuss about unsolved conflicts. However, by analysing the data collected during a controlled experiment we found that this phase can often be skipped due to the fact that asynchronous discussion resolved most of the conflicts.
Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Wireless Ad Hoc Networks
Authors: Chih-Wei Yi, Fang-Chun Liu, Min-Te Sun
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The concept of the forwarding set has been used extensively by many broadcast protocols in wireless ad hoc networks to alleviate the broadcast storm problem. In these protocols, when a node receives a broadcast, it only instructs a subset of its neighbors, a.k.a. the forwarding set, to relay the message. In this paper, we propose to use the local minimum disk cover set as the forwarding set in heterogeneous wireless ad hoc networks, where nodes may have different transmission radius. We show that the minimum local disk cover set of a node is equivalent to its skyline set, and propose a divide-and-conquer algorithm with the optimal time complexity O (n log n) to compute the skyline set locally and statelessly.
Exploiting concurrency vulnerabilities in system call wrappers
Authors: Robert N. M. Watson
Venue: Proceedings of the first USENIX workshop on Offensive Technologies (2007)

System call interposition allows the kernel security model to be extended. However, when combined with current operating systems, it is open to concurrency vulnerabilities leading to privilege escalation and audit bypass. We discuss the theory and practice of system call wrapper concurrency vulnerabilities, and demonstrate exploit techniques against GSWTK, Systrace, and CerbNG.
Real-Time Communication in IEEE 802.11 Networks: Timing Analysis and a Ring Management Scheme for the VTP-CSMA Architecture
Authors: Ricardo Moraes, Paulo Portugal, Stefano Vitturi, Francisco Vasques, Pedro F. Souto
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Keeping up with the timing constraints of real-time traffic in wireless environments is a hard task. One of the reasons is that the real-time stations have to share the same communication medium with stations that are out of the sphere-ofcontrol of the real-time architecture. That is, with stations that generate timing unconstrained traffic. The VTP-CSMA architecture targets this problem in IEEE 802.11 wireless networks. It is based on a Virtual Token Passing procedure (VTP) that circulates a virtual token among real-time stations, enabling the coexistence of real-time and non realtime stations in a shared communication environment. The worst-case timing analysis of the VTP-CSMA mechanism shows that the token rotation time is upper-bounded, even when the communication medium is shared with timing unconstrained stations. Additionally, the simulation analysis shows that the token rotation mechanism behaves adequately, even in the presence of error-prone communication channels. Therefore, the VTP-CSMA architecture enables the support of real-time communication in shared communication environments, without the need to control the timing behavior of every communicating device. A ring management procedure for the VTP-CSMA architecture is also proposed, allowing real-time stations to adequately join/leave the virtual ring. This ring management procedure is mandatory for dynamic operating scenarios, such as those found in VoIP applications.
A new flow-based fast handover method for Mobile IPv6 network with route optimization
Authors: Chen Jin, Zhang Xi-Huang
Venue: Computer Communications (2007)

Flow-based fast handover method is designed for Mobile IPv6 network. The FFHMIPv6 uses the flow state information to redirect the traffic flow to a new location. This makes it possible that the reception of packets simultaneously with the BU registration process, thus minimizing the delay experienced in the handover. But it does not consider the route optimization. In this paper, a new flow-based fast handover method is proposed which enhanced the existing flow-based fast handover method to support route optimization. The analysis shows that this scheme has a better performance than the existing FFHMIPv6 scheme.
Analysis and optimization of MAC with constant size congestion window for WLAN
Authors: Jerome Galtier
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In the context of radio distributed networks, we present a generalized approach for the Medium Access Control (MAC) with fixed congestion window. Our protocol is quite simple to analyze and can be used in a lot of different situations. We give mathematical evidence showing that our performance is tight, in the sense that no protocol with fixed congestion window can do better. We also place ourselves in the WiFi/WiMAX framework, and show experimental results enlightening collision reduction of 14% to 21% compared the best known methods. We show channel capacity improvement, and fairness considerations.
Structural Digital Signature and Semi-Fragile Fingerprinting for Image Authentication in Wavelet Domain
Authors: Yan Zhu, Chang-Tsun Li, Hong-Jia Zhao
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper, a novel semi-fragile authentication scheme based on block-mean quantization in the wavelet domain is proposed for image authentication. The scheme is composed of a structural digital signature process and a semi-fragile watermarking/ fingerprinting algorithm. In the signature process, the invariants are extracted as authentication codes from the quantization relationships and hierarchy information of discrete wavelet decomposition. The authentication codes consist of inter-block and intrablock codes in order to detect and localize tampering. The semi-fragile fingerprinting algorithm is intended to embed the signature via the use of block-mean quantization. The proposed scheme can effectively detect and localize the malicious modification while tolerating lossy compression.
_Generalized Fuzzy Ideals of BCH-Algebra
Authors: Juan Du, Zuhua Liao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper we introduce the concepts of 1 2 ( , ) -generalized fuzzy subalgebra, 1 2 ( , ) -generalized fuzzy ideal, 1 2 ( , ) -generalized fuzzy closed ideal , fuzzy subalgebra, fuzzy ideal and ( , 1 2 ( , ) ) q - 1 2 1 2 fuzzy closed ideal of BCH- algebra and study some of their properties. ( , ) ( , ) q - ( , ) ( , ) q - Keywords 1 2 ( , ) -generalized fuzzy subalgebra; 1 2 ( , ) -generalized fuzzy ideal; 1 2 ( , ) -genera- lized fuzzy closed ideal; fuzzy subalgebra ; fuzzy ideal ; ( , 1 2 ( , ) ( , ) q - 1 2 ( , ) ( , ) q - fuzzy closed ideal; closed ideal; BCH-algebra. 1 2 ( , ) ) q
Offshoring and Outsourcing to INDIA
Authors: Werner Burger
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

The company, an avionic company with a high share of equipments in a lot of aircrafts, was very successful in winning new projects for the A380. But very soon we recognized, we can not find the skilled engineers needed, in Germany nor as contractors (engineers with time limited contracts) in Europe. So, what to do? We analyzed our projects, the most critical situation was within the software department, and identified along with the development phase core and non - core - competencies. As we had to develop level A software, software which is critical for the operation of a system - like a flight control system, we had to spent a lot of manpower for testing activities. So we defined activities related to verification and validation - mainly unit testing as none core competence, as an activity which can be outsourced or offshored, see figure 1
Seers and Craftspeople
Authors: Steve Bellovin
Venue: IEEE Security and Privacy (2007)

Columnist Steve Bellovin discusses the need to judge new ideas more by their potential, and less by what they leave unsolved.
A Review of Power Strategies for DFT and ATPG
Authors: Brion Keller, Tom Jackson, Anis Uzzaman
Venue: Proceedings of the 16th Asian Test Symposium (2007)

The issue of increasing power in ASIC design has been understood for many years [1]. Conventionally CMOS design was thought of as "low power". However, CMOS power consumption is now comparable with bipolar technology in the 1990's [6]. In the past power increases could be negated by the use of supply voltage scaling. However, this is no longer practical due to its impact on device performance, reliability and impact on design closure.
Offsets of Two-Dimensional Profiles
Authors: Wayne Tiller, Eric Hanson
Venue: IEEE Computer Graphics and Applications (1984)

An offset capability for planar curves and profiles in a solid modeler leads to the solution of some practical design problems.
Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network
Authors: D. Steinberg
Venue: IEEE Transactions on Computers (1983)

Let O denote the set of permutations performable by a pass through the Omega network (an n-stage shuffle-exchange network), and let p denote an arbitrary permutation of N = 2n elements. In this paper we characterize the sets {p|pO = O} (called left invariants) and {p|Op = O} (called right invariants). This characterization provides a useful criterion for determining whether or not the composition of two permutations belongs to O; it also allows a number of known results to be generalized and their derivations simplified.