In this paper, we tackle a novel problem of mining contrast subspaces. Given a set of multidimensional objects in two classes C+ and C - and a query object o, we want to find top-k subspaces S that maximize the ratio ...
详细信息
Attack representation models (ARMs), such as an Attack Graph and Attack Tree, are widely used for security modeling and analysis. However, they suffer from a scalability problem if the size of a networked system becom...
详细信息
Attack representation models (ARMs), such as an Attack Graph and Attack Tree, are widely used for security modeling and analysis. However, they suffer from a scalability problem if the size of a networked system becomes too large. Previous work focused on model simplifications (also known as pruning), but it may lose security information. To cope with the scalability problem without losing any security information, we propose to use a partition and merge approach (PMA) in an Infrastructure as a Service (IaaS) Cloud. The ARM is simplified into many sub-ARMs in the partition process, and the results obtained from them are combined in the merge process. We conduct a performance analysis using the PMA and we compare it against an exhaustive search method.
The advances of ubiquitous communication infrastructures, the rapid adoption of mobile devices and pervasive computing technologies has allowed e-learning users access to multimedia learning contents in e-learning env...
详细信息
The advances of ubiquitous communication infrastructures, the rapid adoption of mobile devices and pervasive computing technologies has allowed e-learning users access to multimedia learning contents in e-learning environments. However, because of the diversity and heterogeneity of the mobile users, their preferences, and the rich multimedia learning content, it is a major challenge for the access of learning content by the desired devices in the e-learning environment to user's satisfaction in terms of QoS demands. In order to alleviate the challenge of learning content mismatch, content adaptation is essential. To this end, we propose an ACO-based multimedia content adaptation approach, which inherits the adoption of ACO-based path selection behavior in the path computation for appropriate learning content customization. We compare our proposed approach with other two competitive algorithms, measure the performance and find that our proposed algorithms outperforms the basic AntNet and Genetic in terms of success rate, latency, runtime comparison and convergence. The performance evaluations are conducted using NetLogo simulation environment.
One of major application service areas in M2M (Machine-to-Machine) is the smart grid system. In smart grid systems, information and communications technology are used to gather and act on information that is related t...
详细信息
ISBN:
(纸本)9781479978915
One of major application service areas in M2M (Machine-to-Machine) is the smart grid system. In smart grid systems, information and communications technology are used to gather and act on information that is related to the behaviors of consumers and suppliers. The technology is to improve the efficiency, reliability, and economics of the production and distribution of electricity. To make the system more reliable, security is a very important issue. In this paper, we propose secure system architecture and a mechanism to provide security for smart grid system robustness and reliability.
Hadoop is a distributed software platform for processing big data on a large cluster, which implements core mechanism of Google's GFS and MapR educe. The MapR educe job scheduling algorithm is one of the core tech...
详细信息
Hadoop is a distributed software platform for processing big data on a large cluster, which implements core mechanism of Google's GFS and MapR educe. The MapR educe job scheduling algorithm is one of the core technologies of Hadoop. The default job scheduler of Hadoop is FIFO, which will start the job in the order as itis submitted, and this causes the job tobe started later when itis submitted later. This paper uses the round robin with a multiple feedback algorithm tosolve this problem. With this scheduler, the job which is submitted late, will get quick response and be started without long delay. And the results of experiments on the Hadoop benchmark GridM ix indicate that this algorithm can reduce the average response time by 10%-50%.
Many people get lost easily in public places if they are not familiar with the environment. It would be very helpful to have an indoor localization system. Many researches in indoor localization can be found in the li...
详细信息
Many people get lost easily in public places if they are not familiar with the environment. It would be very helpful to have an indoor localization system. Many researches in indoor localization can be found in the literature. However, they usually need to deploy sensors in the environment. It is costly and inconvenient. In this research, we propose to develop a smartphone indoor positioning application based on accelerometer and gyroscope data. The PDR (Pedestrian Dead Reckoning) method is used to build this application. Calibration points are marked both on the floor ground and on the map of the application. The user first finds a calibration mark, stand on it and face the right direction. He/she then place the android icon (representing the user) on top of the calibration point. When he/she starts to move, the android icon also moves on the map following the real-time estimates of step length and orientation change for each step from accelerometer and gyroscope data, respectively. Preliminary results in walking distance and orientation estimation show high accuracy. The application seems promising and useful as long as a map and calibration marks are built in advance.
The present idea is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. It is explained based on the B + -tree and designed to reside i...
详细信息
The present idea is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. It is explained based on the B + -tree and designed to reside in main memory. Point searches and range searches are helped by early termination of searches for non-existent data. Range searches can be processed dept.-first or breath-first. One group of multiple searches can be processed with one pass on the indexing structure to minimize total cost. Implementation options and strategies are explained to show the flexibility of this technology for easy adaption and high efficiency. This indexing structure can be tuned to speed up queries directed at popular ranges of index or index ranges of particular interest to the user.
Question and answer archives have become useful information resources with increase of community based question and answer service. For effective question and answering system, it is important to find semantically sim...
详细信息
Question and answer archives have become useful information resources with increase of community based question and answer service. For effective question and answering system, it is important to find semantically similar questions and retrieve its answer from the archive for user's question. In this paper, we propose a weighted combination of retrieval models for question and answer archives. In contrast to well-known translation based language model, the proposed model reflects significance of each word in user's question by giving variant weight to the word depending on its part-of-speech. In experiment, our model improves performance considerably when compared to conventional ones.
Design is a creative work that demands inspiration, disciplined crafts, and iterative rollouts. To assist such creative works, the generative design technique has been employed, in which design ideas are coded into co...
详细信息
ISBN:
(纸本)9781479959563
Design is a creative work that demands inspiration, disciplined crafts, and iterative rollouts. To assist such creative works, the generative design technique has been employed, in which design ideas are coded into computer programs and the programs build designs on behalf of human designers. Human designers work on programs, instead of designs themselves, to modify models and to adopt new design ideas. Although human designers do not directly develop models, they need to be kept involved in model development programs. This paper is concerned with a generative design method which does not require human designers to be deeply involved in the design process. The proposed method uses a genetic algorithm approach as an enabling mechanism. The genetic algorithm creates various shapes of models using the predefined genetic operators which are developed with the help of human designers. The method assumes that the customers express their preferences on designs and thus the preferences evaluation is incorporated into the fitness function of the genetic algorithm. The proposed method has been applied to ring design works.
暂无评论