ppxscal/embedding_network huggingface dataset:
QoS Management in Home Network
Authors: Guoliang Liu, Shanquan Zhou, Xi Zhou, Xin Huang
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

A home network could control many devices, all of them working together to keep your home comfortable, entertaining, and safe. Home network includes many appliances and heterogeneity networks, which need to different QoS, so how to realize the aim that guarantee the QoS is very important. This article focuses on QoS management in home network based on a hybrid network architecture. This network architecture and QoS management framework are more generally applicable, and we anticipate they will form the basis for home network independent of the physical medium.
Augmenting chains in graphs without a skew star
Authors: Michael U. Gerber, Alain Hertz, Vadim V. Lozin
Venue: Journal of Combinatorial Theory Series B (2006)

The augmenting chain technique has been applied to solve the maximum stable set problem in the class of line graphs (which coincides with the maximum matching problem) and then has been extended to the class of claw-free graphs. In the present paper, we propose a further generalization of this approach. Specifically, we show how to find an augmenting chain in graphs containing no skew star, i.e. a tree with exactly three vertices of degree 1 of distances 1, 2, 3 from the only vertex of degree 3. As a corollary, we prove that the maximum stable set problem is polynomially solvable in a class that strictly contains claw-free graphs, improving several existing results.
An Attribute Based Storage Method for Speeding up CLIQUE Algorithm for Subspace Clustering
Authors: Jyoti Pawar, P. R. Rao
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

The subspace clustering algorithm CLIQUE finds all subspace clusters including overlapping clusters existing in high dimensional datasets. CLIQUE consists of three main steps namely (1) Identification of subspaces that contain clusters, (2) Identification of clusters and (3)Generation of the minimal description for the clusters obtained in step two. In this paper, we have presented a method for speeding-up the first step of the CLIQUE algorithm. The proposed method is based on accessing the data from columns instead of rows. It is very efficient when there are many missing values in the high dimensional datasets given in the form of table. We have also proposed a depth-first method to find the maximal dense units, to further improve the performance of the first step.
Using Adaptive Circuits to Mitigate Process Variations in a Microprocessor Design
Authors: Eric S. Fetzer
Venue: IEEE Design Test (2006)

With each successive technology generation, process and environmental variations consume an increasingly large portion of the design envelope. To mitigate the impact of these variations, designs can incorporate adaptive techniques to reduce the impact. At the core of adaptability is the fundamental idea that each piece of silicon is different and will respond differently to stimuli. This poses a significant challenge in testing the product because testing relies on all parts behaving in a predictable manner every time they are tested. This article details adaptive techniques used on a dual-core, 90-nm Itanium microprocessor, and the issues and limitations encountered when testing this design.
Fault-Tolerant Destributed Systems in a Mobile Agent Model
Authors: Youhei Tanaka, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

A transactional agent is a mobile agent to manipulate objects with some type of commitment condition. We assume computers may stop by fault while networks are reliable. In the client-server model, servers are fault-tolerant according to the replication and checkpointing technologies. However, an application program cannot be performed if a client is faulty. A program can be performed on another operational computer even if a computer is faulty in the transactional agent model. There are kinds of faulty computers; current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactional agent is tolerant of the types of computer faults.
A New Algorithm of Face Recognition with Illumination Variation
Authors: Wu Lifang, Zhao Xiaoqing, He Xiaoguang, Tu Ling, Tian Jie
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, an algorithm is proposed to recognize faces with illumination variation. First the reflectance at every point is estimated by symmetry on face from two images in different known illumination. Then face images in different illumination are generated by the reflectance. Finally, Face recognition is implemented by comparing the similarity between test image and generated images. Experimental results from Yale Face Database B confirm the efficiency of our algorithm.
A framework for benchmarking e-procurement in the AEC industry
Authors: Yongjie (Star) Chen, Jeff H. Rankin
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

The architecture-engineering-construction (AEC) industry applies a wait-and-see approach because there are no suitable strategic electronic procurement (e-procurement) solutions for the industry. The benefit of electronic procurement is anecdotal for the industry in advance of determining its value. It is necessary to evaluate e-procurement and measure the added value during implementation in order to motivate users to adopt it. In this research project a survey was conducted to provide a clearer picture of the level of penetration of e-procurement. Functional benchmarking parameters were established to quantify the values of e-procurement and an adoption of these parameters in the AEC industry was presented for a later comparison between the construction sector and manufacturing industry. The results of the comparison indicate potential opportunities for e-procurement in the AEC industry. However, there is a conflict with the real situation in the industry in that e-procurement service providers are focused on the supply side not on the demand side; and there is another conflict with current trends in that e-procurement technological providers are focus on individual enterprises not on industry associations. To overcome the conflicts, an electronic business platform is suggested as a strategic e-procurement model for the industry.
Fast simulation for multifactor portfolio credit risk in the t-copula model
Authors: Wanmo Kang, Perwez Shahabuddin
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We present an importance sampling procedure for the estimation of multifactor portfolio credit risk for the t-copula model, i.e, the case where the risk factors have the multivariate t distribution. We use a version of the multivariate t that can be expressed as a ratio of a multivariate normal and a scaled chi-square random variable. The procedure consists of two steps. First, using the large deviations result for the Gaussian model in Glasserman, Kang, and Shahabuddin (2005a), we devise and apply a change of measure to the chi-square random variable. Then, conditional on the chi-square random variable, we apply the importance sampling procedure developed for the Gaussian copula model in Glasserman, Kang, Shahabuddin (2005b). We support our importance sampling procedure by numerical examples.
Mobile studying and social usability on a wireless campus
Authors: Kirsi Päykkänen, Hanna Räisänen, Hannakaisa Isomäki
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

When mobile technology is utilized successfully in computer supported collaborative learning, it can engender students' feelings of belonging to a safe virtual community, which helps to construct shared knowledge through collaboration and applying information and experiences received from others. In this paper, our main argument is that collaborative learning through mobile technology can be successful only if virtual communication is supported by suitable means. In this case, different factors of knowledge sharing and social usability in the virtual learning environment along with issues of data security within the wireless network become crucial with respect to collaborative learning that is supported by mobile technology.
Application of fractional calculus to ultrasonic wave propagation in human cancellous bone
Authors: N. Sebaa, Z. E. A. Fellah, W. Lauriks, C. Depollier
Venue: Signal Processing (2006)

Ultrasonic wave propagation in human cancellous bone is considered. Fractional calculus is used to describe the viscous interactions between fluid and solid structure. Reflection and transmission scattering operators are derived for a slab of cancellous bone in the elastic frame using Blot's theory. Experimental results are compared with theoretical predictions for slow and fast waves transmitted through human cancellous bone samples.
Impact of production run length on supply chain performance
Authors: David J. Parsons, Robin J. Clark, Kevin L. Payette
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper documents an experiment designed to show the value of simulation in understanding the relationship between production run lengths and overall supply chain performance. Current production practices and supply chain policies of an existing company provided the starting point for the experiment. The experiment consisted of two deployment scenarios and a range of run length multipliers that vary the company's actual run length rules. Minimum cost run lengths were determined for twelve combinations of cost assumptions for changeovers and inventories.
DVTS Video Frame Rate Adjustment Based on Motion Detection
Authors: Nawat Kamnoonwatana, Andrey Kuprianov, Poompat Saengudomlert, Teerapat Sanguankotchakorn, Kanchana Kanchanasut
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

DVTS (Digital Video Transport System) is a high quality video transfer system that is suitable for high performance network environments. In order to transmit a DV stream in a narrow bandwidth environment, the existing approach allows the sender to reduce the frame rate to suit with the available bandwidth. However, one drawback of this method is that the frame rate is fixed for a single DV stream resulting in an inefficient use of network bandwidth. This is because sometimes the motion of objects in the video stream is very small and it is possible to further reduce the frame rate without significantly degrading the video quality. The proposed method is designed to automatically adjust the frame rate by exploiting the motion in the DV stream. The calculation of amount of motion is based on a simple motion detection mechanism that uses temporal differences between corresponding Y (luminance) components of two consecutively sampled DV frames.
Predictive Causal Approach for Student Modeling
Authors: Alejandro Pena, Humberto Sossa, Agustin Gutierrez
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

This work proposes a Student Model (SM) oriented to predict causal effects that teaching and learning experiences produce on a student before their delivery. Our student modeling approach elicits concepts from domains that depict the educative program and the individual profile of the student, as content description and cognitive skills. The Cognitive Map sketches causal-effect relationships among the concepts involved by means of Fuzzy Rule Bases. Concepts and relations are fully described in an ontology. Based on the ontology, it is outcome a Cognitive Map for each option of teaching-learning experience. The analysis of the model depicted by the Cognitive Map is done through its activation. This process is a kind of simulation, which traces fuzzy causal inferences in order to estimate behaviors and final states for the concepts. The prediction of the causal results is achieved according to the interpretation of the evolution and final values of the concepts. So in Web-based Education Systems (WBES) that own several options for content, sequencing, and evaluation material, our student modeling offers a predictive support for student-centered education.
New Mobile Technologies: Sustaining or Disruptive?
Authors: Su-En Tan, Anders Henten
Venue: Proceedings of the International Conference on Mobile Business (2006)

This paper takes a look at Clayton Christensen's theory of disruptive technologies and how Christensen's theory relates to other innovation theories. It also proposes a new layer of analysis to this theory to better link the technology analysis to the market analysis of any given technology product. This layer suggests that complementarity and substitutability are important criteria for technologies to be market disruptions or sustaining changes.
Adaptive Replication Method Based on Peer Behavior Pattern in Unstructured Peer-to-Peer Systems
Authors: Taizo Yamada, Kenro Aihara, Atsuhiro Takasu Takasu, Jun Adachi
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this paper, we propose replication methods to perform effective document sharing on a peer-to-peer(P2P) system where peers frequently join and leave the system. The proposed method uses the relevancy and usefulness of peers to determine how many replications should be made, and where to locate these replications. This paper shows empirically that the proposed method improves the efficiency of query processing.
Redundant parallel data transfer schemes for the grid environment
Authors: R. S. Bhuvaneswaran, Yoshiaki Katayama, Naohisa Takahashi
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

In this paper, we proposed dynamic co-allocation schemes for parallel data transfer in a grid environment, which copes up with highly inconsistent network performances of the servers. We have developed an algorithm using circular queue, with which, the data transfer tasks are allocated onto the servers in duplication. It is further improved to maintain the ordered delivery of data blocks, to suit such applications, like streaming. The schemes nicely tackle even when the link to servers under consideration is broken or become idle. We used Globus toolkit for our framework and utilized the partial copy feature of GridFTP. We compared our schemes with the existing schemes and the preliminary results show notable improvement in overall completion time of data transfer.
Digital Flight: The Last CFD Aeronautical Grand Challenge
Authors: M. D. Salas
Venue: Journal of Scientific Computing (2006)

A case is made for a computational fluid dynamics (CFD) effort to predict aircraft flight characteristics, with a focus on stability and control. Problems in predicting stability and control are discussed. The state-of-the-art in CFD, as it relates to aircraft flight predictions, is reviewed. Problems affecting grid convergence studies are analyzed. The computer resources needed to address flight simulation problems are estimated. The status of critical technologies is briefly discussed.
The Media are the Message: 'The Influencers'
Authors: Ed Bride
Venue: IEEE Annals of the History of Computing (2006)

The author reflects on the impact of media and other opinion leaders in the 1970s and early 1980s on the emerging software industry: The fortunes of companies in the nascent personal computer market rose or fell, depending on what these opinion magnates said, wrote, or did (or did not).
Real-Time Multi-Agent Support for Decentralized Management of Electric Power
Authors: H. F. Wedde, S. Lehnhoff, E. Handschin, O. Krause
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

Establishing clean or renewable energy sources involves the problem of adequate management for the networked power sources, in particular since producers are at the same time also consumers, and vice versa. We describe the first phases of the joint R&D project DEZENT between the School of Computer Science and the College of Electrical Engineering at the University of Dortmund, devoted to decentralized and adaptive electric power management through a distributed real-time multiagent architecture. Unpredictable consumer requests or producer problems, under distributed control or local autonomy will be the major novelty. We present a distributed real-time negotiation algorithm involving agents on different levels of negotiation, on behalf of producers and consumers of electric energy. Despite the lack of global overview we are able to prove that in our model no coalition of malicious users could take advantage of extreme situations like arising from an abundance as much as from any (artificial) shortage of electric power that are typical problems in "free" or deregulated markets. Our multi-agent system exhibits a very high robustness against power failures compared to centrally controlled architectures. In extensive experiments we demonstrate how, in realistic settings of the German power system structure, the novel algorithms can cope with unforeseen needs and production specifics in a very flexible and adaptive way, taking care of most of the potentially hard deadlines already on the local group level (corresponding to a small subdivision). We further demonstrate that under our decentralized approach customers pay less than under any conventional (global) management policy or structure.
Metelitsyn's inequality and stability criteria in mechanical problems
Authors: A. P. Seyranian, W. Kliem
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Asymptotic stability criteria for general linear mechanical systems are studied. It is shown that the inequality first derived by Metelitsyn (1952) is a sufficient but not a necessary condition for asymptotic stability. We argue that this inequality is of little use in applications. The theorems of Metelitsyn based on his inequality as well as critical comments in the literature on these theorems are analyzed. Practical sufficient stability criteria are obtained in terms of extreme eigenvalues of the system matrices. This analysis is of special value for rotor systems in a complex setting, which is demonstrated by three examples.
Verifying space and time requirements for resource-bounded agents
Authors: Natasha Alechina, Mark Jago, Piergiorgio Bertoli, Brian Logan, Chiara Ghidini, Luciano Serafini
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a novel procedure for automatically verifying the space and time requirements for resource-bounded reasoning agents. We represent agents as a finite state machines in which the states correspond the formulas currently held in the agent's memory and the transitions between states correspond to applying the agent's inference rules. To check whether an agent has enough memory to derive a formula &oslash;, we specify the FSM as input to the model-based planner MBP. and check whether the agent has a plan (a choice of memory allocations and inference rule applications), all executions of which lead to states containing &oslash;. Our approach is general enough to admit verification of reasoners with any set of inference rules which can be encoded as transitions between FSM states.
Stochastic analysis of packet-pair probing for network bandwidth estimation
Authors: Kyung-Joon Park, Hyuk Lim, Chong-Ho Choi
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

In this paper, we perform a stochastic analysis of the packet-pair technique, which is a widely used method for estimating the network bandwidth in an end-to-end manner. There has been no explicit delay model of the packet-pair technique primarily because the stochastic behavior of a packet pair has not been fully understood. Our analysis is based on a novel insight that the transient analysis of the G/D/1 system can accurately describe the behavior of a packet pair, providing an explicit stochastic model. We first investigate a single-hop case and derive an analytical relationship between the input and the output probing gaps of a packet pair. Using this single-hop model, we provide a multi-hop model under an assumption of a single tight link. Our model shows the following two important features of the packet-pair technique: (i) The difference between the proposed model and the previous fluid model becomes significant when the input probing gap is around the characteristic value. (ii) The available bandwidth of any link after the tight link is not observable. We verify our model via ns-2 simulations and empirical results. We give a discussion on recent packet-pair models in relation to the proposed model and show that most of them can be regarded as special cases of the proposed model.
S3: a scalable sensing service for monitoring large networked systems
Authors: Praveen Yalagandula, Puneet Sharma, Sujata Banerjee, Sujoy Basu, Sung-Ju Lee
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

Efficiently operating and managing large scale distributed and federated systems is an extremely challenging problem. Current solutions are a combination of centralized management and significant over-provisioning of the infrastructure. With the explosion of new resource-intensive media applications and services, over provisioning of the infrastructure is no longer a viable option. Timely and accurate knowledge of the global environment (particularly the highly dynamic network path properties) is necessary for management of performance SLAs, just-in-time resource provisioning, near-optimal dynamic service placement and reuse, construction of network service overlays, and fast detection of failures and malicious attacks. Further, different applications require information about different aspects of the environment at different timescales. We propose S3, a Scalable Sensing Service, that achieves the above requirements and enables personalized sensing of the environment as dictated by applications.
A Decision Support System for Software Project Management
Authors: Paolo Donzelli
Venue: IEEE Software (2006)

Software engineering projects are complex sociotechnical systems whose behavior is the result of many technical and human factors, from personnel skills to development tools and processes to business goals. Project managers must identify the right combination of these factors to obtain the desired results. In many fields, managers get support from sophisticated decision support systems, but these haven't yet entered the software engineering mainstream. A hybrid modeling approach can quickly produce process models that can provide project managers accurate predictions, help them design the desired project trajectory, and validate process changes. The NASA Software Engineering Laboratory process provides a case study.
Design specifications of a generic supply chain simulator
Authors: Shigeki Umeda, Y. Tina Lee
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper describes a design specification for a generic, supply-chain-simulation system. The proposed simulation system is based on schedule-driven and stock-driven control methods to support the supply chain management. The simulation system includes three processing modes: business process flows, material process flows, and information process flows. The paper also discusses interface data requirements for the proposed supply-chain-simulation system.