記述言語：日本語   出版者・発行元：情報処理学会  

本稿では，ビッグデータに関して，その基本概念から，産官学における動向，課題について概観する．特に，利用側の視点から，組織におけるビッグデータの活用段階に注目して，今後のビッグデータ活用の勘所について述べる

CiNii Books

J-GLOBAL

researchmap

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）   出版者・発行元：IEEE  

Service providers want to know user attributes and recorded information in order to improve more satisfaction of the people, or the efficiency of their services by offering services specialized to the users' preferences. However, since they choose wrong way to collect, classify, analysis, use or disclose to others, of personal information, it may exceed the explicit or implicit of the user regarding the provision of personal information. So far, many anonymization methods for those data have been proposed to solve this problem. As one of anonymous method, we focus on k-anonymization technique to realize a "'forest from the trees' as described above. In papers in which these methods are proposed, only qualitative analyze or examples are shown that demonstrate the usefulness of anonymized data, which are the outputs of those methods. Since it is generally said that, if the size of data gets bigger, the anonymization of data becomes easier, those methods have not been applied to real huge data. In this paper, we transform the travel records of 722,000 people traveling by train in the Tokyo area with our proposed anonymization methods, analyze the degree to which each of the results is useful, and conclude that the results are useless even when anonymity level is set to low.

DOI： 10.1109/ICSMC.2012.6377859

Web of Science

researchmap

記述言語：英語   掲載種別：研究論文（大学，研究機関等紀要）  

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）   出版者・発行元：SPRINGER-VERLAG BERLIN  

Efficient object searching mechanisms are essential in large-scale networks. Many studies have been done on distributed hash tables (DHTs), which are a kind of peer-to-peer system. In DHT networks, we can certainly get the desired objects if they exist. However, multi-word searches generate much communication traffic. Many studies have tried to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. In using such filters, all nodes in a DHT must share their false positive rate parameter. However, the best false positive rate differs from one node to another. In this paper, we provide a method of determining the best false positive rate, and we use a new filter called a flexible bloom filter, to which each node can set the approximately best false positive rate. Experiments showed that the flexible bloom filter was able to greatly reduce the traffic.

DOI： 10.1007/978-3-642-11368-0_9

Web of Science

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語   出版者・発行元：人工知能学会  

CiNii Books

J-GLOBAL

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語   出版者・発行元：一般社団法人電子情報通信学会  

ユビキタスネットワークやモバイルエージェントの基盤技術として,Peer-to-Peerシステムの一形態である分散ハッシュテーブルの研究が盛んに行われている.分散ハッシュテーブルでは,あるkeyに対応したコンテンツを早く確実に発見することが可能である.だが,複数のkeyによるAND検索においては,大量のトラヒック量が発生する.この課題に対しBloom filterというデータ構造が広く使われている.Bloom filterはFalse positive rate (FPR)というパラメータを設定する必要があるが,filterの制約により,FPRはすべてのノード間で共有する必要があった.一方,最適なFPRは各ノードによって異なる.したがって,これまでは各ノードにおける最適なFPRを実現できなかった.そこで本論文では,各ノードにおける最適なFPRを求め,各ノードがそれぞれ準最適なFPRを設定することができるような新しいfilter (variable-size DBF)を提案する.実験を行い,分散ハッシュテーブルにおけるトラヒック量を更に削減できることを示す.

CiNii Books

J-GLOBAL

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variablesize bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed-size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration, In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.

DOI： 10.1109/ICCCN.2007.4317911

Scopus

researchmap

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）   出版者・発行元：IEEE COMPUTER SOC  

In the near future, applications with location-aware capabilities could be major development targets in the software industry. The current development frameworks rarely pay attention to developing applications for multiple ubiquitous environments. From the perspective of porting or updating applications, there are two dependencies: spatial and localized. These are dependencies on a single environment in which an application is deployed. We propose a new framework that uses a spatio-temporal scope (STS) model to ease deployment of location-aware applications by lessening these dependencies. We describe our model and explain the roles of the STS in the development stages of an application.

DOI： 10.1109/PERCOMW.2007.57

Web of Science

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

researchmap

記述言語：英語   出版者・発行元：IEEE Computer Society  

DOI： 10.1109/CIMCA.2006.174

researchmap

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）   出版者・発行元：SPRINGER  

In distributed hash tables, much communication traffic comes from multi-word searches. The aim of this work is to reduce the amount of traffic by using a bloom filter, which is a space-efficient probabilistic data structure used to test whether or not an element is a member of a set. However, bloom filters have a limited role if several sets have different numbers of elements. In the proposed method, extra data storage is generated when contents' keys are registered in a distributed hash table system. Accordingly, we propose a "divided bloom filter" to Solve the problem of a normal bloom filter. Using the divided bloom filter, we aim to reduce both the amount of communication traffic and the amount of data storage.

Web of Science

researchmap

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：英語  

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：英語   掲載種別：研究論文（学術雑誌）   出版者・発行元：SPRINGER-VERLAG BERLIN  

In future ubiquitous environments, contents (data, movie, text, graphics, etc.) will be more sophisticated and context-aware so that they can enrich user experience. We have proposed the Active Contents (AC) framework, which is based on contents encapsulation with program and aspect definition to allow contents to behave actively. AC can be seen as a software component with several viewpoints of contributors (planner, designer, programmer, etc.). The problem is about maintainability of AC which is modified by the contributors based on their own viewpoints.
In this position paper, we propose a mechanism to allow such contributors to modify AC with context-aware aspect. In our mechanism, based on location binding analysis for AC, parallel executions to be performed at a sepaxate location axe detected and automatically executed using workflow-aware communication.

DOI： 10.1007/11575863_7

Web of Science

researchmap

記述言語：英語  

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

DOI： 10.1527/tjsai.19.311

Scopus

J-GLOBAL

researchmap

記述言語：英語   出版者・発行元：INSTICC Press  

researchmap

記述言語：英語   掲載種別：研究論文（学術雑誌）   出版者・発行元：SPRINGER-VERLAG BERLIN  

We describe a methodology which enables development of flexible and reusable mobile agent applications for location aware indoor environments. The methodology, which is named "Workflow-awareness model" (WFA), is based on a concept where a pair of mobile agents cooperate to perform a given task to realize separation of concerns for software maintenance. The paper outlines the methodology, and shows how the concepts work in the prototype environment. Usefulness of this methodology concerning its efficiency and software engineering aspects are analyzed.

DOI： 10.1007/978-3-540-30178-3_2

Web of Science

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：日本語   掲載種別：研究論文（学術雑誌）  

researchmap

記述言語：日本語  

J-GLOBAL

researchmap

記述言語：日本語   出版者・発行元：一般社団法人情報処理学会  

ユビキタス環境において，ユーザの携帯端末上で動作するアプリケーションには，ユーザから空間的に近くに存在する周辺機器類により提供されるサービスを利用するというユースケースが考えられる．この機能を実現するために，ユーザとデバイスの間の位置関係などの条件を解析し，適切な対処をすることが必要となる．こうした位置関係の条件をアプリケーション開発時に扱う場合，アプリケーションを運用する単一の環境に特化して作成してしまう傾向にある．そのため違う機能の提供されているビルなどで動作させるためのポータビリティに欠けるという問題があり，再開発のコストがかかってしまう．本論文では，周辺機器類をそれらの提供する機能の種類に基づいて抽象化したうえで，アプリケーションやユーザとの位置関係トポロジに基づいたモデル化を行う．このモデルを用いて表現された位置条件に関する処理を，アスペクト指向開発に適用して実行時に結合する方式を適用することでポータビリティの実現を図る．関心事の組合せのために位置情報を用いるためにLocation Scope という概念を提案する．実際にLocation Scope を実現する支援系を設計・実装しその評価を行った．An application that is working in ubiquitous environment needs to satisfy some use cases about using services provided by service appliances considering distances among user and services. In order to achieve this functionality, analyses and reactions for location conditions are required. During developments of these applications, we found tendencies that the applications are made to run only for one environment. This causes the problem when we port the application into another environment, i.e. another building, which means the bad reusability of the application logic. In this paper, we use an abstract location model to describe relations among service appliances and users. In this model, service appliances are classified according to their services descriptions. We applied Aspect-Oriented Software Development (AOSD) with our model for binding main concerns and location related concerns of an application atdeployment time in order to achieve portability. We propose to use a new concept, Location Scope for these bindings. The Location Scope is designed to make structured activities of the main concern, which allows handy description for reactive behaviors related with location issues. We implemented and evaluated the support system of Location Scope.

CiNii Books

researchmap

その他リンク： http://id.nii.ac.jp/1001/00010451/

researchmap

記述言語：日本語   会議種別：シンポジウム・ワークショップ パネル（公募）  

researchmap

記述言語：日本語   会議種別：シンポジウム・ワークショップ パネル（公募）  

researchmap

記述言語：日本語   会議種別：シンポジウム・ワークショップ パネル（公募）  

researchmap

記述言語：日本語   会議種別：シンポジウム・ワークショップ パネル（公募）  

researchmap

記述言語：日本語   会議種別：シンポジウム・ワークショップ パネル（公募）  

researchmap

記述言語：日本語   会議種別：シンポジウム・ワークショップ パネル（公募）  

researchmap