Towards an Adaptive Completion of Sparse Call Detail Records for Mobility Analysis
|
|
- Junior Green
- 5 years ago
- Views:
Transcription
1 Towars an Aaptive Completion of Sparse Call Detail Recors for Mobility Analysis Guangshuo Chen, Aline Carneiro Viana, Carlos Sarraute To cite this version: Guangshuo Chen, Aline Carneiro Viana, Carlos Sarraute. Towars an Aaptive Completion of Sparse Call Detail Recors for Mobility Analysis. Workshop on Data Analytics for Mobile Networking, Mar 2017, Kona, Unite States. <hal > HAL I: hal Submitte on 29 Jan 2017 HAL is a multi-isciplinary open access archive for the eposit an issemination of scientific research ocuments, whether they are publishe or not. The ocuments may come from teaching an research institutions in France or abroa, or from public or private research centers. L archive ouverte pluriisciplinaire HAL, est estinée au épôt et à la iffusion e ocuments scientifiques e niveau recherche, publiés ou non, émanant es établissements enseignement et e recherche français ou étrangers, es laboratoires publics ou privés.
2 Towars an Aaptive Completion of Sparse Call Detail Recors for Mobility Analysis (Highly focuse technical solution) Guangshuo Chen, Aline Carneiro Viana INRIA Saclay 1 Rue Honoré Estienne Orves, Palaiseau, France {name}.{surname}@inria.fr Carlos Sarraute Granata Labs Bartolome Cruz 1818 Vicente Lopez Buenos Aires, Argentina charles@granata.com Abstract Call Detail Recors (CDRs) are a primary source of whereabouts in the stuy of multiple mobility-relate aspects. However, the spatiotemporal sparsity of CDRs often limits their utility in terms of the epenability of results. In this paper, riven by real-worl ata across a large population, we propose two approaches for completing CDRs aaptively, to reuce the sparsity an mitigate the problems the latter raises. Owing to high-precision sampling, the comparative evaluation shows that our approaches outperform the legacy solution in the literature in terms of the combination of accuracy an temporal coverage. Also, we reveal those important factors for completing sparse CDR ata, which shes lights on the esign of similar approaches. Keywors Call etail recors, user mobility, human trajectories, location bounaries. I. INTRODUCTION In the past ecaes, the proliferation of personal mobile evices makes Call Detail Recors (CDRs) a very promising source of location information [1]. Collecte by mobile network operators for billing purposes, CDRs ocument the etails about when, where an how mobile phone subscribers generate voice calls or text messages, usually across remarkably large populations. The rich information from CDRs has le to a ramatic increase in mobility-relate stuies, such as ientifying important locations [2], optimizing paging in cellular networks [3], an unerstaning ynamics of human mobility [4]. The sparsity of CDRs often has an averse impact on the epenability of stuy results. Due to the bursty an irregular nature of the communication activities they capture, CDRs are habitually sparse in time, an thus may not recor a user s whereabouts with a stable an consistent frequency. The incomplete mobility information from CDRs causes possible biases on characterizing mobility-relate features [5], [6], [7]. To eal with the sparsity, sometimes heavy filters have to be applie on CDRs to select users having enough mobility information [8]. Data completion aims at filling spatiotemporal gaps in CDRs as much an accurate as possible. It is to locate users continuously in time by leveraging the information of users instantaneous whereabouts. Though it oes not fully conquer the sparsity, as locations logge by CDRs are usually incomplete [7], ata completion can relieve the temporal sparsity of CDRs an problems the latter raises. The legacy solution for completing sparse CDR ata is to hypothesize that a cell tower location ocumente in a CDR is available an representative for a perio (typically one hour) rather than only at a time instant when an activity happens, as use in [8], [9]. This solution is actually a reflection of human nature, i.e., one tens to stay in the vicinity of her voice call places most of the time [10]. A major rawback with the legacy solution is that it always expans all CDRs by the same perio. One this point, previous finings have shown that using a fixe perio at all time is inaequate. In the scenario of etermining whether an when a mobile subscriber stays at home uring the nighttime, Hoteit et al. [6] foun that estimating the home perio aaptively by historical CDRs outperforme the legacy solution with using a fixe perio (10pm, 7am) in terms of accuracy. In the general scenario of completing CDRs uring the aytime, we foun that the legacy solution aforementione might lea to a significant spatial error in our previous work [7], which reporte significantly that the spatial error was positively correlate with the cell size. The stuies above reveal the importance of having an aaptive approach for ata completion for better accuracy. So far, however, there has been little iscussion about this aspect. Although [6] propose an aaptive solution for the scenario of ientifying user s home, it is not a universal esign an oes not consier the environmental information like the cell size. In this paper, we keep on focusing on ata completion for CDRs. We explore (i) what can be extracte from CDRs as features for their completion, an (ii) which features are critical to the esign of a universal aaptive approach. Our results contribute to the effort on reliable CDR ata completion in the following ways. Our investigation is base on two real-worl atasets. Compare with previous GPS atasets, the ataset which we leverage as groun-truth still features high temporal resolution but covers movements of a larger number of users. Details are provie in Sec. II. We propose two aaptive approaches for completing sparse CDR ata an assess their quality on hunres of thousans of CDRs leveraging the groun truth information. They outperform the legacy solution: keep-
3 ing a low spatial error an shortening uncomplete perios. Also, we she light on the main features which are relate to completing CDRs through learning realworl ata. Details are provie in Sec. III. Conclusions are finally iscusse in Sec. IV. II. DATASETS We leverage two atasets collecte from a major cellular operator in Mexico: the target ataset which is compose of CDRs, an the flow ataset to buil groun truth information of user movements. The target ataset contains CDRs of 36, 735 users recore from April 1st to August 31st, On each of these ays, CDRs are collecte uring [10am, 6pm], prevailing working hours. Each CDR provies the etaile information of a user s activity (i.e., a phone call or a text message), consisting of the involve evices (i.e., caller/callee or message sener/receiver, as anonymize ientifiers), the activity time, the routing cell tower location, an the activity uration. The flow ataset is compose of flows collecte uring [10am, 6pm] across the same population as the target ataset 1. Each flow escribes the lifecycle of a TCP or UDP session, an consists of the evice ientifier, the session time, an, particularly, the cell tower location where a session ens. Therefore each user has a fine-graine iscrete trajectory of locations by her flows. Due to the operator s limits of privacy, we can only have three ays of flows (July 19th, 20th an August 9th, 2015). On these ays, we use the flows to construct continuous mobility information as groun truth. For that we complement each iscrete trajectory by expaning each flow from a time instant to a continuous perio, as illustrate in Fig. 2(1). We plot the cumulative istribution function () of the number of recors an the inter-event time in Fig. 1(a) an Fig. 1(b), respectively. The figures reveal that: (i) each user has far more flows than CDRs (95% of users have less than 10 calls but more than 200 flows); (ii) these flows sprea the 8- hour observing perio with a ense temporal coverage (in 95% of cases, a user has two consecutive flows within 100 secons, but only in 20% of cases, has two consecutive CDRs). Overall, the flow ataset contains fine-graine mobility information. Its high temporal granularity ensures flows capture all hanovers of cell towers in the observing perio of each ay, an thus supports the use of trajectories in this flow ataset as groun truth in our analysis. III. CDR DATA COMPLETION In this section, we propose two aaptive approaches for completing CDR ata. The approaches are riven by real ata an aim at filling temporal gaps of unknown locations between consecutive activities. We evaluate their performance 1 The following ata pre-processing steps are carrie out prior to our analysis, in orer to guarantee that every user s movement satisfies an appropriate temporal granularity in the flow ataset. We first apply the recursive lookahea filter on each user s flows to tackle the unesirable effects of celltower oscillation [11]. We then filter out those who have two consecutive flows within higher than 20 minutes. We refer the reaer to [7] for all etails. Flows: Sunay Flows: Monay CDRs: Sunay CDRs: Monay Number of recors (flows or CDRs) per user (a) Number of Recors Flow: Sunay Flow: Monay CDR: Sunay CDR: Monay Inter-event time (secons) (b) Inter-event Time Fig. 1. (a) of the number of CDRs (as ashe lines) an flows (as soli lines) per user. (b) of the inter-event time between two consecutive CDRs (as ashe lines) an flows (as soli lines). Estimate CDR Location Bounary Actual Time: Flows Cell: t1 -t A B C D t2 t3 t4 t5 A A B C D t = (t2+t3) Fig. 2. A emo of (1) constructing the groun truth an (2) estimating a location bounary by the static approach: (1) Suppose five consecutive flows recore at time t 1,..., t 5 an at cell locations A, B, C, D. The two flows at t 1 an t 2 are merge as they are observe consecutively at the same cell A. Each transition between two cells is assume to occur at the mi-time of corresponing consecutive flows. In this way, a continuous trajectory is built. (2) The static approach estimates a fixe-perio location bounary ( t, +t ) attache with a CDR at time t CDR at the cell C, so as to assume the user remains at the cell C uring this perio, while actually she moves from the cell B to D, inicating that only a sub-perio is accurate in this location bounary. by comparing with the legacy solution introuce in Sec. I which we refer as the static approach in the following. The static approach is to hypothesize that a user always stays in the corresponing cell uring a perio centere at the time of each CDR, as illustrate in Fig. 2(2). By the static approach, we present the iea of location bounary. Each location bounary contains a perio corresponing to the completion of a CDR representing that a user s whereabout uring this perio. In the static approach, all CDRs are complete by symmetric location bounaries of the same size ( t, +t ). The perio in a location bounary shoul be estimate accoring to the very situation of the activity. For instance, a location bounary eserves a large t if the user is walking when making a call, but fits a small t if she is on a highspee train. The arbitrary etermination of t in the static approach leas to a significant spatial error in practice ue to the complexity of a user s realistic behavior [7]. With regars to this, we introuce two novel aaptive approaches, where t (or t (s), t(e) ) in a location bounary is aaptively etermine by its own CDR, unlike the static approach which uses a unifie threshol. They are (i) the sym-aaptive approach makes a CDR into a symmetric location bounary as ( t, +t ) an (ii) the asym-aaptive tcdr +t
4 approach makes a CDR into an asymmetric location bounary as ( t (s), +t(e) ). In the following, we introuce how a location bounary is estimate in the two aaptive approaches in Sec. III-A. After that, we compare all the three approaches from two perspectives: accuracy an coverage, iscusse in Sec. III-B. A. Determining aaptive location bounaries Observable factors from CDRs: Leveraging a large number of a user s CDRs collecte uring the long-term observing perio, we can learn her behavior for ientifying a location bounary though the following factors in three categories: 1) Event-relate factors: These are the metaata of a CDR, incluing the activity s time, type (call/message) an uration 2. 2) Long-term behavior factors: The raius of gyration (URg) of a user, the number of a user s locations (ULoc) appearing in the observing perio, an the number of a user s active ays (UDAY). These factors characterize a user by giving senses of (i) her long-term mobility an (ii) her habit on generating calls an text messages, compute by her CDRs prouce uring the 5-month observing perio. 3) Location-relate factors: The first factor in this category is relate to the cell size 3, i.e., the average call raius (CR). Since we have no knowlege of the actual cell coverage, we assume a homogeneous propagation environment an an isotropic raiation of power in all irections at each cell tower, so that we are able to roughly estimate each cell s CR using a composition of Voronoi cells extracte from CDRs which covers the area, as in [7]. The rest of the factors escribe the location where the activity happens regaring its importance to the user. For that, we learn from the algorithm presente by Isaacman et al. [2], which is esigne to etermine prominent locations which the user usually spens a large amount of time an/or visits frequently. Their algorithm firstly clusters all locations which appear in a user s trajectory of CDRs, an then ientify for each cluster whether a cluster is important by measuring these observable factors erive from each cluster in the following, as use in our work: (i) the number of ays on which any cell tower in the cluster was contacte (CDay); (ii) the number of ays which elapse between the first an the last contact with any location in the cluster (CDur); (iii) the sum of the number of ays cell towers in the cluster were contacte (CTDay); (iv) the number of cell towers the cluster (CTower); (v) the istance from the activity location to the centroi of the cluster (CDist). Training an estimating: We evelop our approaches by firstly training our moel with a set of 65, 791 CDRs collecte on August 9th. The other two ays, i.e., July 19th an 20th, on which we have the groun-truth information are then utilize into the testing phase. In this way, the moel is traine having as input the above escribe factors an the location bounaries extracte from the groun-truth information. More 2 For this attribute, the uration of a text message is set to 0 secon. 3 We exclue the antenna-relate information such as the transmit power or RF propagation environment, which a mobile operator rarely provies. URg CR Time UDay ULoc Dur CTDay CDist CDur CDay CTower Type Relative Importance Fig. 3. Relative Importance of features in etermining accurate location bounaries. specially, given a CDR, its user an location, we erive a vector (x 1,, x n ) from the above factors, such as: (i) the categorial factor type is converte to two binary features by one-hot encoing; (ii) the time is converte to two separate time ifferences (in secons) from the activity time to 10am an to 6pm; (iii) other factors are use as values they are. In the sym-aaptive approach, this vector an the symmetric location bounary ( t, +t ) of each activity extracte from the groun-truth information are provie as input to a moel traine by Graient Boosting Regression Trees (GBRT) [12], uner the square loss function. Once the training phase is complete, the testing phase consists in estimating the interval ( t, +t ) by feeing the vector erive from 136, 562 CDRs collecte on the other ays (July 19th an 20th) into the regression formula. In the asym-aaptive approach, the factors vector an the two limits of an asymmetric location bounary, i.e., t (s) an t (), of each activity extracte from the groun-truth information are separately provie as input resulting in two traine GBRT moels. The training phase is the same as in the sym-aaptive approach but works inepenently on the two moels. Fig. 3 shows the relative importance of factors with respect to the estimation of a location bounary after the training phase of the aaptive approaches. This figure allows us rawing the following main conclusions, vali for both approaches. We notice the three most important factors: the activity s time, the cell raius, an the raius of gyration. This inicates that for a cell, how long a user stays insie mainly epens on its size, the precise time the activity occure, an the user s long-term mobility. Surprisingly, the activity s type is the most pointless factor, inicating that knowing whether a user generates a call or a message is useless in etermining a location bounary. B. Coverage an accuracy To valiate the location bounaries given by the three previous iscusse completion approaches, we again use the CDRs collecte on July 19th an 20th, on which we have the groun-truth information. Note that our approaches are applicable to CDRs on other ays, though there is no groun-truth information. Hereafter, we use the ays having groun-truth information only for comparison an valiation reasons. For
5 the static approach, t is set to 5/15/30/45/60/90/120 minutes for location bounaries, respectively. Aitionally, since the goal of ata completion is to fill the temporal gaps, we compare the three approaches in terms of accuracy an coverage. For that, we use the following measures to quantify the complete CDRs: Spatial error: The average cumulative error in the istance over time uring a location bounary, quantifies accuracy in terms of activity. Coverage: The filling rate, efine as the ratio of the covere uration (i.e., the sum of the perios of a user s location bounaries) to the observing perio, represents to what egree a user s CDRs are complete. Accuracy: The ratio of the accurate uration (i.e., the sum of all accurate sub-perios) to the covere uration (i.e., the sum of all perios) on a user s location bounaries, quantifies accuracy in terms of the user. Intuitively, an ieal ata completion approach shoul cover the observing perio as much an precise as possible, i.e., satisfying high accuracy an coverage simultaneously. Fig. 4(a)(b) plots the istribution of the spatial error over all location bounaries. It confirms that the spatial error increases as t becomes larger when using the static approach, which is reveale in our earlier work [7]. More importantly, the performance of the two aaptive approaches is nearly as goo as the static approach with t = 30 minutes in terms of the spatial error. To further compare the approaches in terms of the combination of accuracy an coverage, we plot in Fig. 4(c)() the mean of accuracy versus mean of coverage over the observing users. We notice that using a large t contributes to enhancing coverage with reucing accuracy as a price, inicating that the static approach cannot achieve high accuracy an high coverage together. However, the two aaptive approaches show spleni performance. The sym-aaptive approach reaches the same level of accuracy as the static with t = 30 minutes. Yet it has a better temporal coverage (approximately as goo as the static with t = 90 minutes). This inicates that the symaaptive approach can complete more time while it can still ensure accuracy. As to the asym-aaptive approach, it performs better in terms of coverage with losing a small egree of accuracy, compare with the sym-aaptive approach, an still outperforms the static. Overall, we see a clear avantage of the sym-aaptive approach over the others in Fig. 4, as it achieves the best combination of fair accuracy an high temporal coverage. IV. CONCLUSION In this paper, we focuse on ata completion an propose two novel ata-riven approaches which utilize multiple factors of a user s behavior an etermine location bounaries aaptively for completing CDRs. The comparative evaluation showe that the propose approaches outperforme the legacy mean of coverage 0.9 t = 5 min t = 30 min t = 60 min t = 120 min sym-aaptive asym-aaptive Spatial Error of Location Bouary in ( t, +t) (km) (a) Spatial Error: Sunay ±120min ±90min Static Sym-Aaptive Asym-Aaptive ±60min ±45min 0.3 ±30min ±15min 0.1 ±5min mean of accuracy (c) Accuracy/Coverage: Sunay mean of coverage 0.9 t = 5 min t = 30 min t = 60 min t = 120 min sym-aaptive asym-aaptive Spatial Error of Location Bouary in ( t, +t) (km) 0.3 (b) Spatial Error: Monay ±120min ±90min ±60min ±45min ±30min Static Sym-Aaptive Asym-Aaptive ±15min 0.1 ±5min mean of accuracy () Accuracy/Coverage: Monay Fig. 4. of the spatial error of location bounaries compute on (a) Sunay an (b) Monay; mean of accuracy versus mean of coverage per user on (c) Sunay an () Monay, across the static, sym-aaptive an asym-aaptive approaches. solution in the literature. Further research shoul be one to investigate a heuristic approach which oes not rely on the contextual information. ACKNOWLEDGMENT The authors woul like to thank GranData for proviing the ata use for the experiments. This work was supporte by the EU FP7 ERANET program uner grant CHIST-ERA MACACO. REFERENCES [1] D. Naboulsi, M. Fiore, S. Ribot, an R. Stanica, Large-scale mobile traffic analysis: a survey, IEEE Communications Surveys & Tutorials, vol. 18, no. 1, pp , [2] S. Isaacman, R. Becker, R. Cáceres, S. Kobourov, M. Martonosi, J. Rowlan, an A. Varshavsky, Ientifying important places in peopleś lives from cellular network ata, in Pervasive computing, 2011, pp [3] H. Zang an J. C. Bolot, Mining call an mobility ata to improve paging efficiency in cellular networks, in ACM MobiCom 2007, 2007, pp [4] M. C. González, C. A. Hialgo, an A.-L. Barabási, Unerstaning iniviual human mobility patterns, Nature, vol. 453, no. 7196, pp , Jun [5] G. Ranjan, H. Zang, Z.-L. Zhang, an J. Bolot, Are call etail recors biase for sampling human mobility? ACM SIGMOBILE Mobile Computing an Communications Review, vol. 16, no. 3, pp , [6] S. Hoteit, G. Chen, A. Viana, an M. Fiore, Filling the gaps: On the completion of sparse call etail recors for mobility analysis, in ACM CHANTS 2016, 2016, pp [7] G. Chen, S. Hoteit, A. C. Viana, M. Fiore, an C. Sarraute, Relevance of Context for the Temporal Completion of Call Detail Recor, INRIA Saclay, Research Report RT-482, Nov [Online]. Available: [8] C. Song, Z. Qu, N. Blumm, an A.-L. Barabási, Limits of Preictability in Human Mobility, Science, vol. 327, no. 5968, pp , Feb
6 [9] H. H. Jo, M. Karsai, J. Karikoski, an K. Kaski, Spatiotemporal correlations of hanset-base service usages, EPJ Data Science, vol. 1, pp. 1 18, [10] M. Ficek an L. Kencl, Inter-Call Mobility moel: A spatio-temporal refinement of Call Data Recors using a Gaussian mixture moel. IEEE INFOCOM 2012, pp , [11] M. A. Bayir, M. Demirbas, an N. Eagle, Mobility profiler: A framework for iscovering mobility profiles of cell phone users, Pervasive an Mobile Computing, vol. 6, no. 4, pp , [12] J. H. Frieman, Greey function approximation: a graient boosting machine, Annals of statistics, pp , 2001.
Human Trajectory Recovery via Mobile Network Data
Human Trajectory Recovery via Mobile Network Data Guangshuo Chen, Aline Carneiro Viana, Marco Fiore To cite this version: Guangshuo Chen, Aline Carneiro Viana, Marco Fiore. Human Trajectory Recovery via
More informationTaking Benefit from the User Density in Large Cities for Delivering SMS
Taking Benefit from the User Density in Large Cities for Delivering SMS Yannick Léo, Anthony Busson, Carlos Sarraute, Eric Fleury To cite this version: Yannick Léo, Anthony Busson, Carlos Sarraute, Eric
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationd 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationUnderstanding Mobile Data Demand regarding Mobility
Guangshuo Chen To cite this version: Guangshuo Chen. Understanding Mobile Data Demand regarding Mobility: The report for mid-term thesis evaluation. [Technical Report] INRIA Saclay. 216.
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationA Practical Evaluation Method of Network Traffic Load for Capacity Planning
A Practical Evaluation Method of Network Traffic Load for Capacity Planning Takeshi Kitahara, Shuichi Nawata, Masaki Suzuki, Norihiro Fukumoto, Shigehiro Ano To cite this version: Takeshi Kitahara, Shuichi
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5th International Conference on Avance Design an Manufacturing Engineering (ICADME 25) Research on motion characteristics an application of multi egree of freeom mechanism base on R-W metho Xiao-guang
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationTakeaways in Large-scale Human Mobility Data Mining. Guangshuo Chen, Aline Carneiro Viana, and Marco Fiore
Takeaways in Large-scale Human Mobility Data Mining Guangshuo Chen, Aline Carneiro Viana, and Marco Fiore Human Mobility Investigation Locations time General Networking Prediction Reconstruction Characterization
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationA Plane Tracker for AEC-automation Applications
A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)
More informationVery Tight Coupling between LTE and WiFi: a Practical Analysis
Very Tight Coupling between LTE and WiFi: a Practical Analysis Younes Khadraoui, Xavier Lagrange, Annie Gravey To cite this version: Younes Khadraoui, Xavier Lagrange, Annie Gravey. Very Tight Coupling
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationSupervised tracking and correction of inconsistencies in RDF data
Supervise tracking an correction of inconsistencies in RDF ata Youen Péron, Frééric Raimbault, Gilas Ménier, Pierre-François Marteau To cite this version: Youen Péron, Frééric Raimbault, Gilas Ménier,
More informationA Framework for Dialogue Detection in Movies
A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki
More informationOverlap Interval Partition Join
Overlap Interval Partition Join Anton Dignös Department of Computer Science University of Zürich, Switzerlan aignoes@ifi.uzh.ch Michael H. Böhlen Department of Computer Science University of Zürich, Switzerlan
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationEvolutionary Optimisation Methods for Template Based Image Registration
Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South
More informationFuzzy Learning Variable Admittance Control for Human-Robot Cooperation
Fuzzy Learning ariable Amittance Control for Human-Robot Cooperation Fotios Dimeas an Nikos Aspragathos Abstract This paper presents a metho for variable amittance control in human-robot cooperation tasks,
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationNET Institute*
NET Institute* www.netinst.org Working Paper #08-24 October 2008 Computer Virus Propagation in a Network Organization: The Interplay between Social an Technological Networks Hsing Kenny Cheng an Hong Guo
More informationPerformance Characterization of a Bluetooth Piconet with Multi Slot Packets
Performance Characterization of a Bluetooth Piconet with Multi Slot Packets aniele Miorani Carlo Caimi Anrea anella To cite this version: aniele Miorani Carlo Caimi Anrea anella. Performance Characterization
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationTop-down Connectivity Policy Framework for Mobile Peer-to-Peer Applications
Top-own Connectivity Policy Framework for Mobile Peer-to-Peer Applications Otso Kassinen Mika Ylianttila Junzhao Sun Jussi Ala-Kurikka MeiaTeam Department of Electrical an Information Engineering University
More informationA PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset
Vol.3, Issue.1, Jan-Feb. 013 pp-504-508 ISSN: 49-6645 A PSO Optimize Layere Approach for Parametric Clustering on Weather Dataset Shikha Verma, 1 Kiran Jyoti 1 Stuent, Guru Nanak Dev Engineering College
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationA Novel Density Based Clustering Algorithm by Incorporating Mahalanobis Distance
Receive: November 20, 2017 121 A Novel Density Base Clustering Algorithm by Incorporating Mahalanobis Distance Margaret Sangeetha 1 * Velumani Paikkaramu 2 Rajakumar Thankappan Chellan 3 1 Department of
More informationExploring Context with Deep Structured models for Semantic Segmentation
1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en Hengel, Ian Rei between an image patch an a large backgroun image region. Explicitly moeling
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationChange Detection System for the Maintenance of Automated Testing
Change Detection System for the Maintenance of Automated Testing Miroslav Bures To cite this version: Miroslav Bures. Change Detection System for the Maintenance of Automated Testing. Mercedes G. Merayo;
More informationAn FCA Framework for Knowledge Discovery in SPARQL Query Answers
An FCA Framework for Knowledge Discovery in SPARQL Query Answers Melisachew Wudage Chekol, Amedeo Napoli To cite this version: Melisachew Wudage Chekol, Amedeo Napoli. An FCA Framework for Knowledge Discovery
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationOn the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems
On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,
More informationDirected Louvain : maximizing modularity in directed networks
Directe Louvain : maximizing moularity in irecte networks Nicolas Dugué, Anthony Perez To cite this version: Nicolas Dugué, Anthony Perez. Directe Louvain : maximizing moularity in irecte networks. [Research
More information3D CITY REGISTRATION AND ENRICHMENT
3D CITY REGISTRATION AND ENRICHMENT J. A. Quinn, P. D. Smart an C. B. Jones School of Computer Science, Cariff University {j.a.quinn, p.smart, c.b.jones}@cs.cf.ac.uk KEY WORDS: City moels, registration,
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationBoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm
BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard To cite this version: Zeina Azmeh, Fady Hamoui, Marianne Huchard. BoxPlot++. RR-11001, 2011. HAL Id: lirmm-00557222 https://hal-lirmm.ccsd.cnrs.fr/lirmm-00557222
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationDual Arm Robot Research Report
Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationHandling missing values in kernel methods with application to microbiology data
an Machine Learning. Bruges (Belgium), 24-26 April 2013, i6oc.com publ., ISBN 978-2-87419-081-0. Available from http://www.i6oc.com/en/livre/?gcoi=28001100131010. Hanling missing values in kernel methos
More informationSupporting Fully Adaptive Routing in InfiniBand Networks
XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar
More informationA Voronoi-Based Hybrid Meshing Method
A Voronoi-Based Hybrid Meshing Method Jeanne Pellerin, Lévy Bruno, Guillaume Caumon To cite this version: Jeanne Pellerin, Lévy Bruno, Guillaume Caumon. A Voronoi-Based Hybrid Meshing Method. 2012. hal-00770939
More informationTacked Link List - An Improved Linked List for Advance Resource Reservation
Tacked Link List - An Improved Linked List for Advance Resource Reservation Li-Bing Wu, Jing Fan, Lei Nie, Bing-Yi Liu To cite this version: Li-Bing Wu, Jing Fan, Lei Nie, Bing-Yi Liu. Tacked Link List
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationIndexing the Edges A simple and yet efficient approach to high-dimensional indexing
Inexing the Eges A simple an yet efficient approach to high-imensional inexing Beng Chin Ooi Kian-Lee Tan Cui Yu Stephane Bressan Department of Computer Science National University of Singapore 3 Science
More informationA fast embedded selection approach for color texture classification using degraded LBP
A fast embee selection approach for color texture classification using egrae A. Porebski, N. Vanenbroucke an D. Hama Laboratoire LISIC - EA 4491 - Université u Littoral Côte Opale - 50, rue Ferinan Buisson
More informationImproving Web Search Ranking by Incorporating User Behavior Information
Improving Web Search Ranking by Incorporating User Behavior Information Eugene Agichtein Microsoft Research eugeneag@microsoft.com Eric Brill Microsoft Research brill@microsoft.com Susan Dumais Microsoft
More informationDecentralised and Privacy-Aware Learning of Traversal Time Models
Decentralised and Privacy-Aware Learning of Traversal Time Models Thanh Le Van, Aurélien Bellet, Jan Ramon To cite this version: Thanh Le Van, Aurélien Bellet, Jan Ramon. Decentralised and Privacy-Aware
More informationVerifying performance-based design objectives using assemblybased vulnerability
Verying performance-base esign objectives using assemblybase vulnerability K.A. Porter Calornia Institute of Technology, Pasaena, Calornia, USA A.S. Kiremijian Stanfor University, Stanfor, Calornia, USA
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationAssisted Policy Management for SPARQL Endpoints Access Control
Assisted Policy Management for SPARQL Endpoints Access Control Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien Gandon To cite this version: Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien
More informationNew Version of Davies-Bouldin Index for Clustering Validation Based on Cylindrical Distance
New Version of Davies-Boulin Inex for lustering Valiation Base on ylinrical Distance Juan arlos Roas Thomas Faculta e Informática Universia omplutense e Mari Mari, España correoroas@gmail.com Abstract
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationPolitehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques
Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose
More informationRobust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks
Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,
More informationUsing Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1
Using Ray Tracing for Site-Specific Inoor Raio Signal Strength Analysis 1 Michael Ni, Stephen Mann, an Jay Black Computer Science Department, University of Waterloo, Waterloo, Ontario, NL G1, Canaa Abstract
More informationRegularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material
Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material Yingying Song, David Brie, El-Hadi Djermoune, Simon Henrot To cite this version: Yingying Song,
More informationComparator: A Tool for Quantifying Behavioural Compatibility
Comparator: A Tool for Quantifying Behavioural Compatibility Meriem Ouederni, Gwen Salaün, Javier Cámara, Ernesto Pimentel To cite this version: Meriem Ouederni, Gwen Salaün, Javier Cámara, Ernesto Pimentel.
More informationA new fuzzy visual servoing with application to robot manipulator
2005 American Control Conference June 8-10, 2005. Portlan, OR, USA FrA09.4 A new fuzzy visual servoing with application to robot manipulator Marco A. Moreno-Armenariz, Wen Yu Abstract Many stereo vision
More informationObject Recognition Using Colour, Shape and Affine Invariant Ratios
Object Recognition Using Colour, Shape an Affine Invariant Ratios Paul A. Walcott Centre for Information Engineering City University, Lonon EC1V 0HB, Englan P.A.Walcott@city.ac.uk Abstract This paper escribes
More informationExploring Context with Deep Structured models for Semantic Segmentation
APPEARING IN IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, APRIL 2017. 1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en
More informationMANJUSHA K.*, ANAND KUMAR M., SOMAN K. P.
Journal of Engineering Science an echnology Vol. 13, No. 1 (2018) 141-157 School of Engineering, aylor s University IMPLEMENAION OF REJECION SRAEGIES INSIDE MALAYALAM CHARACER RECOGNIION SYSEM BASED ON
More informationDetecting Overlapping Communities from Local Spectral Subspaces
Detecting Overlapping Communities from Local Spectral Subspaces Kun He, Yiwei Sun Huazhong University of Science an Technology Wuhan 430074, China Email: {brooklet60, yiweisun}@hust.eu.cn Davi Binel, John
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationAdvanced method of NC programming for 5-axis machining
Available online at www.scienceirect.com Proceia CIRP (0 ) 0 07 5 th CIRP Conference on High Performance Cutting 0 Avance metho of NC programming for 5-axis machining Sergej N. Grigoriev a, A.A. Kutin
More informationChapter 5 Proposed models for reconstituting/ adapting three stereoscopes
Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,
More informationLocal Path Planning with Proximity Sensing for Robot Arm Manipulators. 1. Introduction
Local Path Planning with Proximity Sensing for Robot Arm Manipulators Ewar Cheung an Vlaimir Lumelsky Yale University, Center for Systems Science Department of Electrical Engineering New Haven, Connecticut
More informationExercises of PIV. incomplete draft, version 0.0. October 2009
Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary
More informationCompact Routing on Internet-Like Graphs
Compact Routing on Internet-Like Graphs Dmitri Krioukov Email: ima@krioukov.net Kevin Fall Intel Research, Berkeley Email: kfall@intel-research.net Xiaowei Yang Massachusetts Institute of Technology Email:
More informationThroughput prediction in wireless networks using statistical learning
Throughput prediction in wireless networks using statistical learning Claudina Rattaro, Pablo Belzarena To cite this version: Claudina Rattaro, Pablo Belzarena. Throughput prediction in wireless networks
More informationArchitecture Design of Mobile Access Coordinated Wireless Sensor Networks
Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,
More informationResearch Article Research on Law s Mask Texture Analysis System Reliability
Research Journal of Applie Sciences, Engineering an Technology 7(19): 4002-4007, 2014 DOI:10.19026/rjaset.7.761 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitte: November
More informationNAND flash memory is widely used as a storage
1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage
More informationASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler
ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler François Gonard, Marc Schoenauer, Michele Sebag To cite this version: François Gonard, Marc Schoenauer, Michele Sebag.
More informationMalware models for network and service management
Malware models for network and service management Jérôme François, Radu State, Olivier Festor To cite this version: Jérôme François, Radu State, Olivier Festor. Malware models for network and service management.
More informationOpen Access Adaptive Image Enhancement Algorithm with Complex Background
Sen Orers for Reprints to reprints@benthamscience.ae 594 The Open Cybernetics & Systemics Journal, 205, 9, 594-600 Open Access Aaptive Image Enhancement Algorithm with Complex Bacgroun Zhang Pai * epartment
More informationSetup of epiphytic assistance systems with SEPIA
Setup of epiphytic assistance systems with SEPIA Blandine Ginon, Stéphanie Jean-Daubias, Pierre-Antoine Champin, Marie Lefevre To cite this version: Blandine Ginon, Stéphanie Jean-Daubias, Pierre-Antoine
More informationNew Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction
New Geometric Interpretation an Analytic Solution for uarilateral Reconstruction Joo-Haeng Lee Convergence Technology Research Lab ETRI Daejeon, 305 777, KOREA Abstract A new geometric framework, calle
More informationHow to simulate a volume-controlled flooding with mathematical morphology operators?
How to simulate a volume-controlled flooding with mathematical morphology operators? Serge Beucher To cite this version: Serge Beucher. How to simulate a volume-controlled flooding with mathematical morphology
More information