ppxscal/embedding_network huggingface dataset:
Raksha: a flexible information flow architecture for software security
Authors: Michael Dalton, Hari Kannan, Christos Kozyrakis
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

High-level semantic vulnerabilities such as SQL injection and crosssite scripting have surpassed buffer overflows as the most prevalent security exploits. The breadth and diversity of software vulnerabilities demand new security solutions that combine the speed and practicality of hardware approaches with the flexibility and robustness of software systems. This paper proposes Raksha, an architecture for software security based on dynamic information flow tracking (DIFT). Raksha provides three novel features that allow for a flexible hardware/software approach to security. First, it supports flexible and programmable security policies that enable software to direct hardware analysis towards a wide range of high-level and low-level attacks. Second, it supports multiple active security policies that can protect the system against concurrent attacks. Third, it supports low-overhead security handlers that allow software to correct, complement, or extend the hardware-based analysis without the overhead associated with operating system traps. We present an FPGA prototype for Raksha that provides a full featured Linux workstation for security analysis. Using unmodified binaries for real-world applications, we demonstrate that Raksha can detect high-level attacks such as directory traversal, command injection, SQL injection, and cross-site scripting as well as low-level attacks such as buffer overflows. We also show that low overhead exception handling is critical for analyses such as memory corruption protection in order to address false positives that occur due to the diverse code patterns in frequently used software.
An approach to evaluate policy similarity
Authors: Dan Lin, Prathima Rao, Elisa Bertino, Jorge Lobo
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

Recent collaborative applications and enterprises very often need to efficiently integrate their access control policies. An important step in policy integration is to analyze the similarity of policies. Existing approaches to policy similarity analysis are mainly based on logical reasoning and boolean function comparison. Such approaches are computationally expensive and do not scale well for large heterogeneous distributed environments (like Grid computing systems). In this paper, we propose a policy similarity measure as a filter phase for policy similarity analysis. This measure provides a lightweight approach to pre-compile a large amount of policies and only return the most similar policies for further evaluation. In the paper we formally define the measure, by taking into account both the case of categorical attributes and numeric attributes. Detailed algorithms are presented for the similarly computation. Results of our case study demonstrates the efficiency and practical value of our approach.
Color image coding by vector subbands/ECVQ and activity map
Authors: H. D. Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A novel vector subbands/ECVQ approach for image coding is presented which incorporates the concept of activity map. A key issue in vector subband coding is the efficient compression of the small energy-albeit perceptually significant, upper-bands of the decomposed images. As the components of the significant vectors in the upper subbands display the contour information of the original images, therefore, the locations and orientations of such (predominantly) edge information can be determined from the original image. The availability of this knowledge motivated us to generate the activity map, which in turn is used to obtain transmission control maps. The control maps are used to turn on/off the transmission of vectors. Most importantly, the approach is extended and applied to color image coding. Experimental results show remarkably good performance of the proposed approach.
A Class of Static and Dynamic Hierarchical Interconnection Networks
Authors: Peter Thomas Breznay, Mario Alberto Lopez
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

A TCN is a hierarchical interconnection network where isomorphic clusters are connected using a complete graph at the highest level of hierarchy. We extend the concept of TCN to the dynamic domain and reduce the hardware complexity in the static domain. The resulting networks outperform both its non-hierarchical and hierarchical counterparts, while improving on the congestion and fault-tolerance characteristics of the latter; they also have optimal connectivity, high bisection width, low degree, cost and diameter, and low average distance under both uniform and non-uniform traffic. For instance, with dynamic clusters we obtain the same delay as the corresponding non hierarchical multistage network at 1/2 the cost; while the maximum and average delays are typically 2/3 and 3/4 of those in a comparable HMIN, at approximately the same cost. In the static case, using hypercube clusters, the degree, diameter and cost are approximately 1/2, 3/4 and 3/8 of the same parameters in a comparable size hypercube; while the diameter and average distance are typically 1/2 and 3/4 of those in traditional HINs. In case of mesh clusters, the diameter and cost are reduced even further, by an amount proportional to their square root.
Optimization for QoS on Web-Service-Based Systems with Tasks Deadlines
Authors: Luis Fernando Orleans, Pedro Nuno Furtado
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Web-Services-based parallel systems (WSB-P) should exhibit predictable behavior by guaranteeing Quality-of-Service parameters. One of the important requirements of predictability is that requests (tasks) should have maximum acceptable response time thresholds, which we denote as deadlines in this paper. In order to provide QoS, a WSB-P should try to guarantee these deadlines. Such policy affects the way the system should be designed, because all task durations must be under the deadline, and also how tasks are distributed among the servers. This way, it is desirable to use a load balancing algorithm that tries to both maximize the throughput and minimize the missed deadlines. This paper shows, with the help of a simulator, how the number of concurrent executions (CE) in the WSB-P plays a crucial role in the pursuit of the objective and how the optimal CE can be determined.
Leveraging Resource Prediction for Anticipatory Dynamic Configuration
Authors: Vahe Poladian, David Garlan, Mary Shaw, M. Satyanarayanan, Bradley Schmerl, Joao Sousa
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Self-adapting systems based on multiple concurrent applications must decide how to allocate scarce resources to applications and how to set the quality parameters of each application to best satisfy the user. Past work has made those decisions with analytic models that used current resource availability information: they react to recent changes in resource availability as they occur, rather than anticipating future availability. These reactive techniques may model each local decision optimally, but the accumulation of decisions over time nearly always becomes less than optimal. In this paper, we propose an approach to selfadaptation, called anticipatory configuration that leverages predictions of future resource availability to improve utility for the user over the duration of the task. The approach solves the following technical challenges: (1) how to express resource availability prediction, (2) how to combine prediction from multiple sources, and (3) how to leverage predictions continuously while improving utility to the user. Our experiments show that when certain adaptation operations are costly, anticipatory configuration provides better utility to the user than reactive configuration, while being comparable in resource demand.
Decision feedback equalization for Bluetooth systems
Authors: M. Nafie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Gaussian frequency shift keying modulation has been chosen as the modulation technique for the physical layer of Bluetooth. Bluetooth is a standard for low cost and low power wireless communications between various mobile devices. The optimal demodulation of a GFSK signal involves an extremely complex Viterbi decoder. Therefore designers have opted for the noncoherent detection of GFSK which uses a frequency discriminator, followed by symbol by symbol detection. We describe a decision feedback equalizer to be added after the discriminator. The DFE receiver gives gains in excess of 2 dB. We also describe how to increase the current data rate of a Bluetooth system by increasing the symbol rate and not the alphabet size.
Distributed access control: a privacy-conscious approach
Authors: Bogdan Cautis
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

With more and more information being exchanged or published on the Web or in peer-to-peer, and with the significant growth in numbers of distributed, heterogeneous data sources, issues like access control and data privacy are becoming increasingly complex and difficult to manage. Very often, when dealing with sensitive information in such settings, the specification of access control policies and their enforcement are no longer handled by the actual data sources, and are (partially) delegated to third-parties. Besides practical reasons, this is the case when decisions regarding access depend on factors which overpass the scope and knowledge of some of the entities involved. More specifically, policies may depend on private aspects concerning users (accessing data) or data owners. In this case, the only solution is to entrust some third-party authority with all the information needed to apply access policies. However, as the policies themselves depend on sensitive information, this outsourcing raises new privacy issues, that were not present in centralized environments. In particular, information leaks may occur during access control enforcement. In this paper, we consider these issues and, starting from non-conventional digital signatures, we take a first step towards an implementation solution for such settings where both data and access policies are distributed. Our approach involves rewriting user queries into forms which are authorized, and we illustrate this for both structured (relational) and semi-structured (XML) data and queries.
Neural network object recognition for inspection of patient setup in radiation therapy using portal images
Authors: S. Young
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper presents a method to improve the performance of inspection of patient setup in radiation therapy using portal images. The proposed algorithm is used to match real-time portal and simulator images which contain the information of patient position relative to the beam position. Two approaches are proposed for this purpose. One approach is to use a multi-scale (multiresolution) analysis of the acquired image where the image is examined at several levels of detail simultaneously. Another approach is to use a more robust optimization method to find the global minimum of a cost function which is generalized from matching both anatomical structures and radiation treatment fields. The optimization method used here is a concurrent (coarse-and-fine) multiresolution model-based object recognition technique using a multi-layer Hopfield neural network. The performance of the algorithm is demonstrated in a clinical radiotherapy application.
Interactive presentation: Reliability-aware system synthesis
Authors: Michael Glaß, Martin Lukasiewycz, Thilo Streichert, Christian Haubelt, Jürgen Teich
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Increasing reliability is one of the most important design goals for current and future embedded systems. In this paper, we will put focus on the design phase in which reliability constitutes one of several competing design objectives. Existing approaches considered the simultaneous optimization of reliability with other objectives to be too extensive. Hence, they firstly design a system, secondly analyze the system for reliability and finally exchange critical parts or introduce redundancy in order to satisfy given reliability constraints or optimize reliability. Unfortunately, this may lead to suboptimal designs concerning other design objectives. Here, we will present a) a novel approach that considers reliability with all other design objectives simultaneously, b) an evaluation technique that is able to perform a quantitative analysis in reasonable time even for real-world applications, and c) experimental results showing the effectiveness of our approach.
MEMS design and fabrication of an electrostatic vibration-to-electricity energy converter
Authors: Yi Chiu, Chiung-Ting Kuo, Yu-Shan Chu
Venue: Microsystem Technologies (2007)

This paper presents a micro electrostatic vibration-to-electricity energy converter based on the micro-electromechanical system. For the 3.3&#x00a0;V supply voltage and 1&#x00a0;cm2 chip area constraints, optimal design parameters were found from theoretical calculation and Simulink simulation. In the current design, the output power is 200&#x00a0;&#x03bc;W/cm2 for the optimal load of 8&#x00a0;M&#x03a9;. The device was fabricated in a silicon-on-insulator wafer. Mechanical and electrical measurements were conducted. Residual particles caused shortage of the variable capacitor and the output power could not be measured. Fabrication processes are being refined to remove the back silicon substrate to eliminate residual particles and parasitic capacitance.
OSMOSIS - Semantic Work-Spaces for Smart Environments
Authors: Luis Veiga, Paulo Ferreira
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Recent advances in device miniaturization have clearly contributed to make Weiser's vision of ubiquitous computing closer to reality. However, such vision is still far from being accomplished because some difficult problems remain to be solved. It is still hard to develop applications that take advantage of the disappearance of the real/virtual barrier, and to support such applications in a way that can be easily integrated with current environments. We propose a middleware approach (OSMOSIS) that employs pragmatic approach to solve the previous drawbacks so that ubiquitous computing can become a reality. It provides a file-system abstraction in order to make real objects virtual so that each real-world object has a virtual counterpart in the form of a file. Thus, the topology of a workplace, or a house, is reflected in the directories and subdirectories organization. The OSMOSIS middleware combines the use of RFID, Location and Context Management and a Policy Engine in order to provide to applications a context-aware file-system enriched with semantic-information.
Building independent black box components in C++
Authors: Mark Addesso
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

When using Object Oriented techniques to build systems, the relationships between objects creates dependencies which inhibit reuse, unit testing and reliability. By using black box components, these relationships can be factored out of the object to create truly independent components. Techniques to design and build systems in this manner are presented. A fairly complex system built with black box components is also described.
How Can I Help You? Call Centres, Classification Work and Coordination
Authors: David Martin, Jacki O'Neill, Dave Randall, Mark Rouncefield
Venue: Computer Supported Cooperative Work (2007)

As a comparatively novel but increasingly pervasive organizational arrangement, call centres have been a focus for much recent research. This paper identifies lessons for organizational and technological design through an examination of call centres and `classification work' --- explicating what Star [1992, Systems/Practice vol. 5, pp. 395---410] terms the `open black box'. Classification is a central means by which organizations standardize procedure, assess productivity, develop services and re-organize their business. Nevertheless, as Bowker and Star [1999, Sorting Things Out: Classification and Its Consequences. Cambridge MA: MIT Press] have pointed out, we know relatively little about the work that goes into making classification schema what they are. We will suggest that a focus on classification `work' in this context is a useful exemplar of the need for some kind of `meta-analysis' in ethnographic work also. If standardization is a major ambition for organizations under late capitalism, then comparison might be seen as a related but as-yet unrealized one for ethnographers. In this paper, we attempt an initial cut at a comparative approach, focusing on classification because it seemed to be the primary issue that emerged when we compared studies. Moreover, if technology is the principal means through which procedure and practice is implemented and if, as we believe, classifications are becoming ever more explicitly embedded within it (for instance with the development of so-called `semantic web' and associated approaches to ontology-based design), then there is clearly a case for identifying some themes which might underpin classification work in a given domain.
Storage reduction for distributed disk-based backup in storage area network
Authors: Junping Sun
Venue:  (2006)

For many organizations today, data is their most important asset. How to safeguard the data in this dynamic environment is an important issue in any organization. The backup process is cumbersome in large organizations. Typically, the backup saves files from a network client to a remote storage location on a daily basis. This means that the same file, often in multiple versions, is saved and stored many times, resulting in excessive storage. A distributed disk-based backup system collects the data to be backed up from network clients and stores files remotely on multiple storage locations in the network. In recent years, Storage Area Network (SAN) has become a popular solution to effectively store or access huge amounts of enterprise information. A SAN is a dedicated storage network designed specifically to connect storage, backup devices, and servers. By consolidating storage in one location, customers benefit from efficiencies of management, utilization, and reliability. Since there is no end in sight to the exponential growth of enterprise data, storage reduction technology plays an important role in enterprise backup. The goal of this study is to investigate how to effectively reduce storage usage through a distributed disk-based backup system in a SAN. The working name for the distributed backup system used for this study is SAN-Backup system. In SAN-Backup system, the backup storage reduction can be made at file level, block level, and backup catalog level. The design and development of this distributed disk-based backup system utilized a phased approach. The prototype of SAN-Backup system was validated through enterprise backup environments. The validation process included backup storage usage and backup performance comparisons between a backup application with an embedded storage reduction technology and a backup application without an embedded storage reduction technology both running in a SAN. The test results showed that SAN-Backup system reduced storage usage by 55.9% when compared to Backup Express Enterprise backup system, and also improved the overall backup performance by 43.74%. The test results indicated that SAN-Backup system did significantly reduce the backup storage usage and also improved the backup performance.
Robust constrained deconvolution
Authors: E. Sekko
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The problem of deconvolution of a signal distorted by a linear time-invariant system is considered. In order to regularise this ill-posed problem; we combined the use of optimal filter, the game theory approach applied to the tracking problem and the priori knowledge such as positivity on the restored signal. To illustrate the robustness of the exposed procedure, two numerical examples are given.
A novel contact resistance model of anisotropic conductive film for FPD packaging
Authors: G. J. Wang, Y. C. Lin, G. S. Lin
Venue: Microsystem Technologies (2007)

A novel contact resistance model for the flat panel display (FPD) packaging based on the within layer parallel and between layers series resistance concepts is proposed in this research. The FJ2530 anisotropic conductive films (ACF) by Sony Inc., containing the currently smallest 3&#x00a0;&#x03bc;m conductive particles, was used to conduct experiments to verify the accuracy of the proposed model. The calculated chip-on-glass (COG) packaging resistance using the proposed model is 0.165&#x00a0;&#x03a9;. It is found that a gold bump with 0.162&#x00a0;&#x03a9; resistance play a major role in the overall resistance. Although the predicted resistance using the proposed model is only one third of the experimentally measured value a threefold improvement is obtained compared to existing models.
Beyond moulin mechanisms
Authors: Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

The only known general technique for designing truthful, approximatelybudget-balanced cost-sharing mechanisms is due to Moulin. While Moulin mechanisms have been successfully designed for a widerange of applications, recent negative results show that for manyfundamental cost-sharing problems, Moulin mechanisms inevitably sufferfrom poor budget-balance, poor economic efficiency, or both. We propose acyclic mechanisms, a new framework for designingtruthful, approximately budget-balanced cost-sharing mechanisms. Acyclic mechanisms strictly generalize Moulin mechanisms andoffer three important advantages. First, it is easier to design acyclic mechanisms than Moulinmechanisms: many classical primal-dual algorithms naturallyinduce a non-Moulin acyclic mechanism with good performanceguarantees. Second, for several important classes of cost-sharing problems, acyclicmechanisms have exponentially better budget-balance and economicefficiency than Moulin mechanisms.Finally, while Moulin mechanisms have found application primarily in binary demand games, we extend acyclic mechanisms to general demand games, a multi-parameter setting in which each bidder can be allocated one of several levels of service.
Passive network tomography using EM algorithms
Authors: Y. Tsang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The paper presents a new method for characterizing communication network performance based solely on passive traffic monitoring at the network edge. More specifically, we devise a novel expectation-maximization (EM) algorithm to infer internal packet loss rates (at routers inside the network) using only observed end-to-end (source to receiver) loss rates. The major contributions of this paper are three-fold: we formulate a passive monitoring procedure for network loss inference based on end-to-end packet pair observations, we develop a statistical modeling and computation framework for inferring internal network loss characteristics, and we evaluate the performance with realistic network simulations.