ppxscal/embedding_network huggingface dataset:
Maximizing job benefits on multiprocessor systems using a greedy algorithm
Authors: Behnaz Sanati, Albert Mo Kim Cheng
Venue: ACM SIGBED Review (2008)

This project considers a benefit model for on-line preemptive multiprocessor scheduling. In this model, each job arrives with its own benefit function and execution time. The flow time of a job is the time between its arrival and its completion. The benefit function determines the benefit gained for any given flow time. The goal is to maximize the total benefit gained only by the jobs that meet their deadlines. In order to achieve this goal, a variety of approximation algorithms and their applications in multiprocessor scheduling were studied. A greedy algorithm with 2- approximation ratio is proposed to be added to an existing benefit based scheduling algorithm, in order to reduce the delay of each job, by assigning it to the processor with least utilization so far. This method will decrease the flow time of the jobs, resulting in higher benefits gained by each job. Also, evaluation of this approach shows that it uses the CPU cycles more efficiently by providing more balanced distribution of the jobs between the processors. Therefore, more jobs can meet their deadlines and add their gained benefits to the total benefit. In addition, the proposed method is computationally less expensive than the existing benefit based method.
System-in-Package Technology: Opportunities and Challenges
Authors: Anna Fontanelli
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

In 2006, the leading wireless phone industry has introduced literally hundreds of new, different wireless phones, which have been manufactured in approximately 1 billion units, generating revenue of about $128B. The semiconductor revenue has been about $33B. The ASP is declining, both in the wireless phone and semiconductor industry. In order to fix that, Moore's Law is being inverted: instead of getting twice the transistors for the same cost, the wireless phones industry seeks to obtain the same number of transistors for half the cost. This is making System-on-chip (SoC) no longer a viable solution. System-in-Package (SiP) looks much more promising.Lack of EDA solutions — especially the A of automation — has so far slowed down the ramp-up of SiP. In this paper we describe the landscape and present a SiP platform solution which addresses the challenges of simplification, cost reduction, quality and reliability improvement, yet allowing exploiting the most recent advances in IC packaging.
Shape-dependent gloss correction
Authors: Peter Vangorp, Philip Dutré
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

Visual observation is one of the primary means to interact with the world around us. However, the interplay of geometry, material, and illumination in the perception of objects is still not entirely understood. It is generally accepted that the shape of objects influences the perception of their material appearance. In this paper we investigate and quantify the influence of shape on gloss perception in a realistic setting, using a general cue combination framework and likelihood analysis. Our results show that this influence can be quantified, and that a simple additive model between the shape cue and the actual gloss cue adequately describes this influence. This paper contributes to a deeper understanding of the perception of objects, and also enables new applications such as a material selection tool that corrects for the influence of gloss when switching between shapes. This improves the intuitiveness of material selection tools for novices as well as professional artists.
Edge vulnerability parameters of bisplit graphs
Authors: Metrose Metsidik, Elkin Vumar
Venue: Computers Mathematics with Applications (2008)

A graph is called bisplit if its vertex set can be partitioned into three stable sets I,Y and Z such that Y@?Z induces a complete bipartite graph (a biclique). In this paper, we investigate the edge vulnerability parameters of bisplit graphs. Let G=(Y@?Z,I,E) be a noncomplete connected bisplit graph with minimum vertex degree @d(G). We prove that its edge-connectivity is @d(G), and if |Z|>=|Y|>=32@d(G), then its edge-toughness is min{@d(G),|E(G)||V(G)|-1}. Examples are given to show that the condition cannot be dropped out. Moreover, it is shown that if |Y@?Z|
Sequential Path Delay Fault Identification Using Encoded Delay Propagation Signatures
Authors: Edward Flanigan, Arkan Abdulrahman, Spyros Tragoudas
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A complete function-based scheme is presented to identify at-speed sequentially untestable path delay faults. We introduce signature variables to implicitly track error propagation through combinational and sequential circuits. The path sensitization test functions are encoded with the signature variables. These encoded test functions allow implicit identification of all propagating transitions corresponding to each individual test function minterm. We then utilize the signature variables during the fault propagation in a way such that the latched error propagates robustly to an observable point irrespective of other latched errors. Results presented on the ISCAS’89 benchmarks show a large number of sequentially untestable path delay faults are identified.
ABCTool: a tool for architecture centric engineering of component based systems
Authors: Hong Mei, Gang Huang
Venue: Companion of the 30th international conference on Software engineering (2008)

In this paper, we present the ABCTool, a visual tool for modeling software architecture in the whole lifecycle of the target system so that the development, deployment, online maintenance and evolution of a component-based system can be done as a series of refinements and transformations of architectural models in a systematic and automated manner.
Coseismic lateral offsets of surface rupture zone produced by the 2001 Mw 7.8 Kunlun earthquake, Tibet from the IKONOS and QuickBird imagery
Authors: A. Lin, M. Nishikawa
Venue: International Journal of Remote Sensing (2007)

Analyses and interpretations of 1m-resolution IKONOS, and 61cm-resolution QuickBird images reveal that the distribution of strike-slip offsets and ground deformation characteristics of the coseismic surface rupture produced by the 2001 M w 7.8 Kunlun earthquake occurred in the western segment of the strike-slip Kunlun fault, northern Tibet. The 2001 coseismic strike-slip offsets measured from IKONOS images range from 2 m up to 16.7 m, generally 3-8 m, which are generally consistent with those measured immediately in the field after the earthquake. The coseismic surface ruptures along which offsets were observed are mainly composed of a numerous of en echelon shear faults and cracks which are concentrated on a rupture zone ranging from a few meters up to ∼500 m in width. The offsets measured along individual shear faults or crack are typically 2-7 m, but up to >10 m in several locations. Our results show that high resolution remote sensing imagery provides a powerful tool for measuring coseismic strike-slip offsets and detecting the ground deformation produced by a large earthquake in the remote and high mountain Tibet region.
High-density plasma silicon oxide thin films grown at room-temperature
Authors: M. E. Vlachopoulou, P. Dimitrakis, A. Tserepi, V. Em. Vamvakas, S. Koliopoulou, P. Normand, E. Gogolides, D. Tsoukalas
Venue: Microelectronic Engineering (2008)

The fabrication at room-temperature of thin (
Hypermedia design patterns
Authors: Jessica Rubart
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

This poster aims at motivating the hypermedia community to identify and describe hypermedia patterns focusing on software design. Design patterns support a shared vocabulary and a shared understanding about design models. In addition, they facilitate reusing prior experience for new designs. An example hypermedia design pattern is provided.
A fuzzy engine model for efficient stock market prediction
Authors: Shereen M. Ahmad, Neamat El Gayar, Hazem Y. Abd Elazim
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

The prediction of stock market is considered a non-trivial problem in the financial arena. In the last few years many sophisticated models were developed to predict the stocks in order to achieve a maximum profit. Fuzzy models are one of the powerful methods that are used in this field. This paper proposes a fuzzy engine model that acts as an expert indicator that can generate buy and sell signals. The fuzzy engine model combines the most popular technical indicators with their firing strengths to provide a new fuzzy indicator that achieves good results compared to the other traditional indicators. Experiments were conducted to evaluate the performance of the model and the results prove that the fuzzy engine model gives more reliable buy and sell positions in different time horizons compared to other technical indicators.
List-decoding reed-muller codes over small fields
Authors: Parikshit Gopalan, Adam R. Klivans, David Zuckerman
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We present the first local list-decoding algorithm for the rth order Reed-Muller code RM(2,m) over F for r ≥ 2. Given an oracle for a received word R: Fm --r - ε) from R for any ε r,ε-r). The list size could be exponential in m at radius 2-r, so our bound is optimal in the local setting. Since RM(2,m) has relative distance 2-r, our algorithm beats the Johnson bound for r ≥ 2. In the setting where we are allowed running-time polynomial in the block-length, we show that list-decoding is possible up to even larger radii, beyond the minimum distance. We give a deterministic list-decoder that works at error rate below J(21-r), where J(δ) denotes the Johnson radius for minimum distance δ. This shows that RM(2,m) codes are list-decodable up to radius η for any constant η q, we present list-decoding algorithms in both the global and local settings that work up to the list-decoding radius. We conjecture that the list-decoding radius approaches the minimum distance (like over F), and prove this holds true when the degree is divisible by q-1.
SOPING: a Chinese customer review mining system
Authors: Chao Zhou, Guang Qiu, Kangmiao Liu, Jiajun Bu, Mingcheng Qu, Chun Chen
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

With the booming development of the Web, popular Chinese forums enable people to find experienced customers' reviews for products. In order to get an all-around opinion about one product, users need to go through plenty of web pages, which is time-consuming and inefficient. Consequently, automatic review mining and summarization has become a hot research topic recently. However, previous approaches are not applicable for mining Chinese customer reviews. In this paper, we introduce SOPING, a Chinese customer review mining system that mines reviews from forums. Specifically, we propose a novel search-based approach to extract product features and a feature-oriented sentence orientation determination method. Our experimental results show that our proposed techniques are highly effective.
Glass frit bonding: an universal technology for wafer level encapsulation and packaging
Authors: Roy Knechtel
Venue: Microsystem Technologies (2005)

This paper reports on glass frit wafer bonding, which is a universally usable technology for wafer level encapsulation and packaging. After explaining the principle and the process flow of glass frit bonding, experimental results are shown. Glass frit bonding technology enables bonding of surface materials commonly used in MEMS technology. It allows hermetic sealing and a high process yield. Metal lead throughs at the bond interface are possible, because of the planarizing glass interlayer. Examples of surface micromachined sensors demonstrate the potential of glass&#x2013;frit bonding.
Co-evolution of terrorist and security scenarios for water distribution systems
Authors: Z. Skolicki, T. Arciszewski, M. H. Houck, K. De Jong
Venue: Advances in Engineering Software (2008)

Identification of vulnerabilities of water distribution systems and identification of appropriate counter-measures are important components of homeland security. These are difficult and time consuming tasks. This paper provides a new approach to resolve these problems in complex infrastructure systems. It is based on the use of co-evolutionary computation for the generation of both terrorist and security scenarios. The basic concepts of co-evolutionary computation are briefly explained. The concept of co-evolutionary generation of terrorist and security scenarios is introduced in the context of a hypothetical water distribution system for a small town. A tool developed at George Mason University is used for a number of experiments that reveal a variety of emerging security patterns. The experiments show that these patterns may be helpful in effectively protecting the network.
On absolute stability of one class of nonlinear switched systems
Authors: A. Yu. Aleksandrov, A. V. Platonov
Venue: Automation and Remote Control (2008)

A certain class of nonlinear switched systems is considered. Methods of developing Lyapynov functions for the systems under study are suggested. Conditions are defined, in the fulfillment of which the asymptotic stability of the zero solution will take place for any witching laws and for any admissible nonlinearities entering into right sides of the equations under discussion.
Birth control for giants
Authors: Joel Spencer, Nicholas Wormald
Venue: Combinatorica (2007)

The standard Erd&#x0151;s-R&#x00e9;nyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n/2 rounds as one time unit, a phase transition occurs at time t = 1 when a giant component (one of size constant times n) first appears. Under the influence of statistical mechanics, the investigation of related phase transitions has become an important topic in random graph theory. We define a broad class of graph evolutions in which at each round one chooses one of two random edges {v 1, v 2}, {v 3, v 4} to add to the graph. The selection is made by examining the sizes of the components of the four vertices. We consider the susceptibility S(t) at time t, being the expected component size of a uniformly chosen vertex. The expected change in S(t) is found which produces in the limit a differential equation for S(t). There is a critical time t c so that S(t) &#x2192; &#x221e; as t approaches t c from below. We show that the discrete random process asymptotically follows the differential equation for all subcritical t < t c . Employing classic results of Cram&#x00e9;r on branching processes we show that the component sizes of the graph in the subcritical regime have an exponential tail. In particular, the largest component is only logarithmic in size. In the supercritical regime t > t c we show the existence of a giant component, so that t = t c may be fairly considered a phase transition. Computer aided solutions to the possible differential equations for susceptibility allow us to establish lower and upper bounds on the extent to which we can either delay or accelerate the birth of the giant component.
Self-healing by means of automatic workarounds
Authors: Antonio Carzaniga, Alessandra Gorla, Mauro Pezzè
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

We propose to use automatic workarounds to achieve self-healing in software systems. We observe that software systems of significant complexity, especially those made of components, are often redundant, in the sense that the same functionality and the same state-transition can be obtained through multiple sequences of operations. This redundancy is the basis to construct effective workarounds for component failures. In particular, we assume that failures can be detected and intercepted together with a trace of the operations that lead to the failure. Given the failing sequence, the system autonomically executes one or more alternative sequences that are known to have an equivalent behavior. We argue that such workarounds can be derived with reasonable effort from many forms of specifications, that they can be effectively prioritized either statically or dynamically, and that they can be deployed at run time in a completely automated way, and therefore that they amount to a valid self-healing mechanism. We develop this notion of self-healing by detailing a method to represent, derive, and deploy workarounds. We validate our method in two case studies.
Traveling waves in a one-dimensional global model of synaptic activity in the cerebral cortex
Authors: J. A. Escamilla, A. Fraguela, L. Cervantes
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

A one-dimensional nonlinear global model of neuronal interaction at cerebral cortex level is here presented, in order to study the dynamics of synaptic excitatory and inhibitory activity of the cortex. We prove that under certain conditions, excitation and inhibition traveling waves appear.
Outlier Detection in Cellular Network Data Exploration
Authors: Mikko Multanen, Kimmo Raivio, Pasi Lehtimäki
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

A cellular network like a GSM network is built up using a number of base stations to cover a large geographical area. The area covered by one base station can be seen as a cell in the network. Regardless of the location of a user the network should be able to provide the services. Therefore each cell should have enough resources to succeed in meeting the demand. Arising from this the analysis of the network can to a certain extent be divided into the analysis of separate cells. In this paper, methods for finding outlying base stations are examined by applying them on the analysis of real data from GSM network. As little as possible prior knowledge of the network is used in the analysis. This way the methods stay more portable into use with data from other networks. The results of the methods are analyzed by comparing them to each other.
Performance Study of PANA Pre-authentication for Interdomain Handover
Authors: Patryk Chamuczynski, Omar Alfandi, Constantin Werner, Henrik Brosene, Dieter Hogrefe
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

To provide seamless mobility to the wireless user, a continuous connection to the Internet is required while moving from one administration domain to another. To enable continuous connectivity, one prerequisite is the incorporation of seamless handover. The make-before-break approach facilitates seamless handover by means of executing an authentication to a new domain simultaneously while maintaining connection to current domain. The connection is only terminated after the handover to the new domain is successfully completed. However, the duration of the authentication is critical for the handover process because if the mobile nodes move very fast the remaining amount of time of connection to the current domain can become very limited. Therefore, it is a vital issue for seamless mobility to study the authentication performance of a pre-authentication framework. In this paper we model an authentication infrastructure and consider a scenario in which a high number of nodes handover to a new administration domain. The simulation of the authentication process shows the relation between authentication performance and traffic intensity. Furthermore we identify some critical points and potential bottlenecks of this pre-authentication approach
Irrevocable transactions and their applications
Authors: Adam Welc, Bratin Saha, Ali-Reza Adl-Tabatabai
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Transactional memory (TM) provides a safer, more modular, and more scalable alternative to traditional lock-based synchronization. Implementing high performance TM systems has recently been an active area of research. However, current TM systems provide limited, if any, support for transactions executing irrevocable actions, such as I/O and system calls, whose side effects cannot in general be rolled back. This severely limits the ability of these systems to run commercial workloads. This paper describes the design of a transactional memory system that allows irrevocable actions to be executed inside of transactions. While one transaction is executing an irrevocable action, other transactions can still execute and commit concurrently. We use a novel mechanism called single-owner read locks to implement irrevocable actions inside transactions that maximizes concurrency and avoids overhead when the mechanism is not used. We also show how irrevocable transactions can be leveraged for contention management to handle actions whose effects may be expensive to roll back. Finally, we present a thorough performance evaluation of the irrevocability mechanism for the different usage models.
Identifying risks for cross-disciplinary higher degree research students
Authors: Karen L. Blackmore, Keith V. Nesbitt
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

Managing attrition rates and completion times of higher degree research students are key considerations for Universities as they are directly tied to future funding for research places. Even where higher degree research students are focused within a single discipline there are a number of risks that can impact on completion. However, there is also evidence of an increase in cross-disciplinary research within Australia. The nature of cross-disciplinary research raises further issues concerning the supervision and progression of PhD candidates and the examination of their works. We discuss a number of issues from a case study of the authors' own PhD experience, which spanned the computing and business disciplines. We conclude by drawing on some experiences in project management from the software engineering community and finally recommend that all participants in higher degree research consider a strategy of preventive risk management.
SIP-based proactive and adaptive mobility management framework for heterogeneous networks
Authors: Y. C. Yee, K. N. Choong, Andy L. Y. Low, S. W. Tan
Venue: Journal of Network and Computer Applications (2008)

In this paper, we present and evaluate the performance of a mobility management system called the Proactive and Adaptive Handover (PAHO) system. PAHO is an application-level approach that uses SIP to manage client-initiated connection handoff across heterogeneous networks based on the IEEE 802.21 framework with designated user/configuration policy. Unlike conventional systems which make sub-optimal decision when managing connection handoff due to limited awareness of the relevant context for the application/service being delivered, PAHO defines proper interface to interact with the application as to determine when and to where the handoff and/or codec switching should take place in the event of network performance degradation. The results showed that using the PAHO approach on an audio/video conferencing session helps reducing the overall handover delay from 10.766s (on non-PAHO system) down to at least 288ms, and slowing down the degradation of MOS value throughout the entire experiment in the event of signal degradation as well as network congestion. It is also shown that load balancing among the access points (AP) could be achieved with an improved Information Server (IS).