ppxscal/embedding_network huggingface dataset:
Identifying Malicious Code Through Reverse Engineering, 1 edition
Authors: Abhishek Singh
Venue:  (2009)

Attacks take place everyday with computers connected to the internet, because of worms, viruses or due to vulnerable software. These attacks result in a loss of millions of dollars to businesses across the world. Identifying Malicious Code through Reverse Engineering provides information on reverse engineering and concepts that can be used to identify the malicious patterns in vulnerable software. The malicious patterns are used to develop signatures to prevent vulnerability and block worms or viruses. This book also includes the latest exploits through various case studies. Identifying Malicious Code through Reverse Engineering is designed for professionals composed of practitioners and researchers writing signatures to prevent virus and software vulnerabilities. This book is also suitable for advanced-level students in computer science and engineering studying information security, as a secondary textbook or reference.
A Metric Approach to nD Images Edge Detection with Clifford Algebras
Authors: Thomas Batard, Christophe Saint-Jean, Michel Berthier
Venue: Journal of Mathematical Imaging and Vision (2009)

The aim of this paper is to perform edge detection in color-infrared images from the point of view of Clifford algebras. The main idea is that such an image can be seen as a section of a Clifford bundle associated to the RGBT-space (Red, Green, Blue, Temperature) of acquisition. Dealing with geometric calculus and covariant derivatives of appropriate sections with respect to well-chosen connections allows to get various color and temperature information needed for the segmentation. We show in particular how to recover the first fundamental form of the image embedded in a LSHT-space (Luminance, Saturation, Hue, Temperature) equipped with a metric tensor. We propose applications to color edge detection with some constraints on colors and to edge detection in color-infrared images with constraints on both colors and temperature. Other applications related to different choices of connections, sections and embedding spaces for nD images may be considered from this general theoretical framework.
Secure and Reliable Communication Infrastructure for a Distributed IT-Federation
Authors: Thang Tran, Kai Daniel, Christian Wietfeld
Venue: Mobile Response: Second International Workshop on Mobile Information Technology for Emergency Response, MobileResponse 2008. Bonn, Germany, May 29-30, 2008, Revised Selected Papers (2009)

One of today's major problems is the lack of detailed and current information on the spot for fire brigades and other action forces (e.g. police). However, access to the distributed information (e.g. location maps of fire hydrants, building plans, air photos) is not always available and has to be requested via paper mail in advance. Particularly, preventive fire protection and reactive fire prevention depending on a high-quality information management, which allows them to arrange a more efficient operation. In order to solve this problem, this paper proposes a design of a secure and reliable role based concept, which permits fast access to confidential information. Furthermore, the technical challenge of the development of such a communication infrastructure is illustrated. A performance analysis of an exemplary Monitoring Service for a distributed IT-Federation is introduced, in which an analytical Boolean Reliability Model is presented as an approach to visualize the bottleneck of a decentralized system.
Proceedings of the 1st workshop on Linking aspect technology and evolution
Venue: Aspect-oriented software development (2009)

The first Practices of Linking Aspect Technology and Evolution (PLATE) workshop, held in conjunction with the 8th International Conference on Aspect-Oriented Software Development (Charlottesville, Virginia, USA), aims at advancing the state-of-the-art concerning techniques, tools and patterns for improving the software engineering properties of aspect-oriented systems in general, and the evolvability of such systems in particular. This workshop welcomes participants from both academia and industry that are willing to share their knowledge and ideas with the community. As such, our workshop aims to attract both experience reports describing best practices obtained by the engineering of real-world, aspect-oriented systems, as well as experimental techniques and tools that improve the evolvability of software systems that use aspect technology, or that apply aspect-oriented techniques in order to improve software evolution in general. Since our goal is to spark bright new ideas and collaborations, we opted from the start for a workshop format that emphasizes on discussion, rather than offering participants a mini-conference filled with only presentations. Therefore, the number and length of presentations at the workshop was limited, in order to maximize the discussion between workshop participants. We consider the workshop a success when the emerging issues raised by the workshop papers lead to a fruitful discussion at the workshop.
Multi-component Teleservice Model for Multimedia Applications
Authors: Omar Alani, Rashid Mehmood
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

In third generation (3G) wireless systems we have a number of resources being used exclusively and simultaneously to satisfy the requirements of an arriving Multimedia call. This would require the occupation and release of these resources to be in a manageable fashion. In this paper, we discuss a multi-component teleservice model for multimedia applications. Subsequently, based on this teleservice model, we introduce and analyse a multi-component based resource allocation scheme (MC-RAS) for call and traffic management that exploits the multi-component nature of multimedia traffic. Practical network parameters were used to evaluate the performance of the scheme as compared with the standard approach based on the single multimedia stream flow. The proposed scheme shows better performance in terms of reducing blocking probabilities.
Overall availability of a robot with internal safety device
Authors: Edmond J. Vanderperre, Stanislav S. Makhanov
Venue: Computers and Industrial Engineering (2009)

We introduce a robot-safety device system composed of a robot with internal (built-in) safety device. The system is characterized by a safety shut-down rule and by the natural feature of standby. In order to obtain the point availability of the twin-system, we introduce a stochastic process endowed with a time-dependent potential satisfying an integro-differential equation. The explicit solution procedure requires the (new) notion of ineffective lifetime - versus - effective lifetime of the robot. The analysis of the long-run availability requires the introduction of a signed measure. As an example, we display a computer-plotted graph of the point availability obtained by inversion of the corresponding Laplace-transform.
Relative Influence of Bottom-Up and Top-Down Attention
Authors: Matei Mancas
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

Attention and memory are very closely related and their aim is to simplify the acquired data into an intelligent structured data set. Two main points are discussed in this paper. The first one is the presentation of a novel visual attention model for still images which includes both a bottom-up and a top-down approach. The bottom-up model is based on structures rarity within the image during the forgetting process. The top-down information uses mouse-tracking experiments to build models of a global behavior for a given kind of image. The proposed models assessment is achieved on a 91-image database. The second interesting point is that the relative importance of bottom-up and top-down attention depends on the specificity of each image. In unknown images the bottom-up influence remains very important while in specific kinds of images (like web sites) top-down attention brings the major information.
Advances in Mobile Mapping Technology: ISPRS Series, volume 4
Authors: Vincent Tao, Jonathan Li
Venue: International Society For Photogrammetry And Remote Sensing (2007)

Mobile mapping refers to a means of collecting geospatial data using mapping sensors mounted on a mobile platform. Its development was primarily driven by the advances in digital imaging and direct-georeferencing technologies. With the escalating use of telecommunication networks and the increasing availability of low-cost and portable sensors, mobile mapping has become more dynamic, and even pervasive. This book addresses a wide variety of research issues in the mobile mapping community, ranging from system development to sensor integration, imaging algorithms and mobile GIS applications. It provides researchers and practitioners a good overall view of what is being developed in this field.
Cross layer design for RFID/EPC network
Authors: Frank Y. Shih, Yao-Chung Chang, Min-Chun Peng, Yu-Shan Lin
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The RFID framework constructed by Reader, Transponder and Middleware system forms a new construction of future production line automation, material management and logistic industry. The EPC (Electronic Product Code) Network, advocated by international organization, EPCglobal Inc., is the standard technology of RFID application. This paper proposes a cross layer design that applies an intelligent mobile purchasing system by combining RFID smart phone at Physical layer, transferring the RFID code into EPC Network at Media Access Control Layer, gathering the EPC Domain Information at Application Layer and establishing the secure EPC network framework with Product of Authority Server (PAS) network environment at Application Layer. By using the cross-layer approach, user can purchase through the smart phone with RFID Reader. Content Web Server and ODS Server are responsible for recording the commodity information by EPC Code. The commodity will be directly sent to user's home through the Object Tracing Function of Secure EPC Network.
Supporting simulation in industry through the application of grid computing
Authors: Navonil Mustafee, Simon J E Taylor
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

An increased need for collaborative research, together with continuing advances in communication technology and computer hardware, has facilitated the development of distributed systems that can provide users access to geographically dispersed computing resources that are administered in multiple computer domains. The term grid computing, or grids, is popularly used to refer to such distributed systems. Simulation is characterized by the need to run multiple sets of computationally intensive experiments. Large scale scientific simulations have traditionally been the primary benefactor of grid computing. The application of this technology to simulation in industry has, however, been negligible. This research investigates how grid technology can be effectively exploited by users to model simulations in industry. It introduces our desktop grid, WinGrid, and presents a case study conducted at a leading European investment bank. Results indicate that grid computing does indeed hold promise for simulation in industry.
On a Fast (k,n)-Threshold Secret Sharing Scheme
Authors: Jun Kurihara, Shinsaku Kiyomoto, Kazuhide Fukushima, Toshiaki Tanaka
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In Shamir's (k, n)-threshold secret sharing scheme (threshold scheme) [1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. However, there is no fast ideal (k, n)-threshold scheme, where k and n are arbitrary. This paper proposes a new fast (k, n)-threshold scheme which uses just EXCLUSIVE-OR(XOR) operations to make n shares and recover the secret from k shares. We prove that every combination of k or more participants can recover the secret, but every group of less than k participants cannot obtain any information about the secret in the proposed scheme. Moreover, the proposed scheme is an ideal secret sharing scheme similar to Shamir's scheme, in which every bit-size of shares equals that of the secret. We also evaluate the efficiency of the scheme, and show that our scheme realizes operations that are much faster than Shamir's.
Quicken 2009 For Dummies
Authors: Stephen L.,  CPA,  MBA,  MS Nelson
Venue: For Dummies (2008)

If just thinking about financial management gives you a headache, personal finance software is better than aspirin. Quicken is tops, and Quicken 2009 For Dummies is the quickest and easiest way to put it to work.Heres the plain-English guide to using the newest update of the nations leading personal finance software. A leading CPA shows you how to track your finances day to day, keep your checkbook and pay bills online, and even plan for tax time with Quicken. Learn as much or as little as you need to know just how to keep your checkbook straight, or even how Quicken helps manage stocks and the business end of rental property.Install and set up Quicken 2009, or update data files from a previous version Learn to make a budget thats flexible enough to work for your family or your business Keep your checkbook up to date, handle banking transactions online, and use Quicken calculators Print Quicken reports to help you track cash flow, identify missing checks, summarize spending, and more Set up tax-deferred or brokerage accounts and buy and sell securities Track your credit cards and bank accounts as well as mortgages, loans, and other debts Use Quickens Home & Business or Rental Property Manager versions to keep your business books Handle payroll for business or household employees Track deductions to make tax preparation easier With Quicken 2009 For Dummies, youll feel like a financial wizard!
A Proof of Security of Yao&#x2019;s Protocol for Two-Party Computation
Authors: Yehuda Lindell, Benny Pinkas
Venue: Journal of Cryptology (2009)

In the mid 1980s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao&#x2019;s protocol, along with a rigorous proof of security. Despite the importance of Yao&#x2019;s protocol to the theory of cryptography and in particular to the field of secure computation, to the best of our knowledge, this is the first time that an explicit proof of security has been published.
Study and Experiment of Blast Furnace Measurement and Control System Based on Virtual Instrument
Authors: Shufen Li, Zhihua Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

This article mainly introduces a blast furnace measurement and control system, which based on the virtual instrument development platform LabView. The hardware takes the ADAM4000 series data acquisition module of Advantech as the core. The system can replace the massive display instruments, finish monitoring the furnace conditions in the production process, and realize to manage the historical data.
Brief paper: H∞ filtering for nonlinear discrete-time stochastic systems with randomly varying sensor delays
Authors: Bo Shen, Zidong Wang, Huisheng Shu, Guoliang Wei
Venue: Automatica (Journal of IFAC) (2009)

This paper is concerned with the H"~ filtering problem for a general class of nonlinear discrete-time stochastic systems with randomly varying sensor delays, where the delayed sensor measurement is governed by a stochastic variable satisfying the Bernoulli random binary distribution law. In terms of the Hamilton-Jacobi-Isaacs inequalities, preliminary results are first obtained that ensure the addressed system to possess an l"2-gain less than a given positive scalar @c. Next, a sufficient condition is established under which the filtering process is asymptotically stable in the mean square and the filtering error satisfies the H"~ performance constraint for all nonzero exogenous disturbances under the zero-initial condition. Such a sufficient condition is then decoupled into four inequalities for the purpose of easy implementation. Furthermore, it is shown that our main results can be readily specialized to the case of linear stochastic systems. Finally, a numerical simulation example is used to demonstrate the effectiveness of the results derived.
Model to Hardware Matching for nm Scale Technologies
Authors: Sani Nassif
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Our ability to reliably predict the outcome of a semiconductor manufacturing process has been steadily deteriorating. This is happening because of two important factors.First, the overall CMOS technology slowdown has led to rapidly increasing complexity in the process and in its interaction with design. This has in turn caused an increase in the number and magnitude of systematic sources of mismatch between simulation models (both at the circuit simulation and timing levels) and hardware measurements.Second, manufacturing variability--long a source of concern only for analog design--is becoming important for digital designs as well and thus its prediction is now a first order priority. However, it is competing for the attention of researchers and CAD developers with a host of other so-called nm effects, thus slowing down the delivery of needed solutions.The result is (a) our ability to arbitrarily compose a design out of disparate components is compromised because of a high degree of interaction between these components and (b) our ability to predict the nominal performance of a design as well as its tolerances and sensitivities is in danger. Phenomena like SRAM stability and leakage power variations are the first of many problems we are facing at 65nm and below.In this talk, we will review these issues and show how they are all related to the core issue of model to hardware matching. We will also show examples of potential solutions to this problem some of which are currently being developed in IBM, and some which are longer term and would benefit greatly from the attention of the academic community.
A note on stability in model reduction
Authors: Amirhossein Yousefi, Boris Lohmann
Venue: International Journal of Systems Science (2009)

This article considers the problem of instability in similarity transformation-based model reduction methods. Given a stable model G(s) of order n, a general framework is proposed that parameterises a large set of stable reduced models of order k
Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
Authors: Samuel Lundqvist
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

We give a new algorithm for merging sorted lists of monomials. Together with a projection technique we obtain a new complexity bound for the Buchberger-Möller algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Continually Learning Optimal Allocations of Services to Tasks
Authors: Youssef Achbany, Ivan J. Jureta, Stephane Faulkner, Francois Fouss
Venue: IEEE Transactions on Services Computing (2008)

Open service-oriented systems which autonomously and continually satisfy users' service requests to optimal levels are an appropriate response to the need for increased automation of information systems. Given a service request, an open service-oriented system interprets the functional and nonfunctional requirements laid out in the request and identifies the optimal selection of services&#x2014;that is, identifies services. These services' coordinated execution optimally satisfies the requirements in the request. When selecting services, it is relevant to: (1) revise selections as new services appear and others become unavailable; (2) use multiple criteria, including nonfunctional ones to choose among competing services; (3) base the comparisons of services on observed, instead of advertised performance; and (4) allow for uncertainty in the outcome of service executions. To address issues (1)&#x2013;(4), we propose the Multi-Criteria Randomized Reinforcement Learning (MCRRL) service selection approach. MCRRL learns and revises service selections using a novel multicriteria-driven (including quality of service parameters, deadline, reputation, cost, and preferences) reinforcement learning algorithm, which integrates the exploitation of data about individual services' past performance with optimal, undirected, continual exploration of new selections that involve services whose behavior has not been observed. The experiments indicate the algorithm behaves as expected and outperforms two standard approaches.
Constraint optimization in call admission control domain with a NeuroEvolution algorithm
Authors: Xu Yang, John Bigham
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

The objective for Call admission control (CAC) is to accept or reject request calls so as to maximize the expected revenue over an infinite time period and maintain the predefined QoS constraints. This is a non-linear constraint optimization problem. This paper analyses the difficulties when handling QoS constraints in the CAC domain, and implements two constraint handling methods that cooperate with a NeuroEvolution algorithm called NEAT to learn CAC policies. The two methods are superiority of feasible points and static penalty functions. The simulation results are compared based on two evolution parameters: the ratio of feasible policies, and the ratio of "all accept' policies. Some researchers argue that superiority of feasible points may fail when the feasible region is quite small compared with the whole search space, however the speciation and complexification features of NEAT makes it a very competitive method even in such cases.
Selecting the best linear simulation metamodel
Authors: Russell Cheng
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We consider the output of a simulation model of a system about which little is initially known. This output is often dependent on a large number of factors. It is helpful, in examining the behaviour of the system, to find a statistical metamodel containing only those factors most important in influencing this output. The problem is therefore one of selecting a parsimonious metamodel that includes only a subset of the factors, but which nevertheless adequately describes the behaviour of the output. The total number of possible submodels from which we are choosing grows exponentially with the number of factors, so a full examination of all possible submodels rapidly becomes intractable. We show how resampling can provide a simple solution to the problem, by allowing potentially good submodels to be rapidly identified. This resampling approach also allows a systematic statistical comparison of good submodels to be made.